/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:26:43,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:26:43,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:26:43,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:26:43,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:26:43,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:26:43,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:26:43,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:26:43,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:26:43,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:26:43,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:26:43,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:26:43,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:26:43,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:26:43,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:26:43,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:26:43,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:26:43,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:26:43,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:26:43,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:26:43,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:26:43,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:26:43,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:26:43,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:26:43,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:26:43,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:26:43,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:26:43,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:26:43,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:26:43,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:26:43,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:26:43,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:26:43,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:26:43,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:26:43,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:26:43,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:26:43,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:26:43,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:26:43,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:26:43,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:26:43,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:26:43,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:26:43,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:26:43,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:26:43,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:26:43,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:26:43,107 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:26:43,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:26:43,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:26:43,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:26:43,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:26:43,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:26:43,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:26:43,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:26:43,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:26:43,109 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:26:43,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:26:43,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:26:43,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:26:43,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:26:43,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:26:43,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:26:43,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:26:43,111 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:26:43,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-12-13 09:26:43,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:26:43,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:26:43,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:26:43,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:26:43,365 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:26:43,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-12-13 09:26:44,412 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:26:44,619 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:26:44,619 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-12-13 09:26:44,628 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a25740e/8382285a8e1742beb25fdfc35808ee44/FLAG656132c25 [2022-12-13 09:26:44,640 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a25740e/8382285a8e1742beb25fdfc35808ee44 [2022-12-13 09:26:44,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:26:44,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:26:44,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:26:44,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:26:44,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:26:44,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:26:44" (1/1) ... [2022-12-13 09:26:44,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826f85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:44, skipping insertion in model container [2022-12-13 09:26:44,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:26:44" (1/1) ... [2022-12-13 09:26:44,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:26:44,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:26:44,821 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i[944,957] [2022-12-13 09:26:44,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:44,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:44,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:26:45,042 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:26:45,050 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i[944,957] [2022-12-13 09:26:45,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:26:45,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:26:45,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:26:45,130 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:26:45,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45 WrapperNode [2022-12-13 09:26:45,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:26:45,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:26:45,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:26:45,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:26:45,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,200 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-13 09:26:45,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:26:45,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:26:45,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:26:45,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:26:45,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,235 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:26:45,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:26:45,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:26:45,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:26:45,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (1/1) ... [2022-12-13 09:26:45,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:26:45,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:26:45,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:26:45,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:26:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:26:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:26:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:26:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:26:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:26:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:26:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:26:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:26:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:26:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:26:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:26:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:26:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:26:45,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:26:45,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:26:45,317 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:26:45,470 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:26:45,471 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:26:45,771 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:26:45,889 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:26:45,889 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:26:45,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:26:45 BoogieIcfgContainer [2022-12-13 09:26:45,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:26:45,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:26:45,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:26:45,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:26:45,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:26:44" (1/3) ... [2022-12-13 09:26:45,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5670408a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:26:45, skipping insertion in model container [2022-12-13 09:26:45,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:26:45" (2/3) ... [2022-12-13 09:26:45,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5670408a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:26:45, skipping insertion in model container [2022-12-13 09:26:45,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:26:45" (3/3) ... [2022-12-13 09:26:45,897 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2022-12-13 09:26:45,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:26:45,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:26:45,912 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:26:45,956 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:26:45,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 09:26:46,041 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 09:26:46,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:26:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 09:26:46,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-13 09:26:46,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-13 09:26:46,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:26:46,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 09:26:46,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-13 09:26:46,101 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-13 09:26:46,101 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:26:46,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 09:26:46,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-13 09:26:46,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 1944 [2022-12-13 09:26:53,878 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 09:26:53,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:26:53,895 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@285c611f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:26:53,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:26:53,909 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 09:26:53,910 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:26:53,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:26:53,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:26:53,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:26:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:26:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash -959834041, now seen corresponding path program 1 times [2022-12-13 09:26:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:26:53,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650966727] [2022-12-13 09:26:53,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:26:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:26:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:26:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:26:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:26:54,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650966727] [2022-12-13 09:26:54,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650966727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:26:54,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:26:54,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:26:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578797670] [2022-12-13 09:26:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:26:54,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:26:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:26:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:26:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:26:54,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 57 [2022-12-13 09:26:54,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-12-13 09:26:54,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:26:54,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 57 [2022-12-13 09:26:54,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:26:55,515 INFO L130 PetriNetUnfolder]: 7385/12155 cut-off events. [2022-12-13 09:26:55,515 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 09:26:55,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22764 conditions, 12155 events. 7385/12155 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 94767 event pairs, 855 based on Foata normal form. 0/7046 useless extension candidates. Maximal degree in co-relation 22753. Up to 9131 conditions per place. [2022-12-13 09:26:55,549 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 28 selfloop transitions, 3 changer transitions 44/86 dead transitions. [2022-12-13 09:26:55,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 331 flow [2022-12-13 09:26:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:26:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:26:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-12-13 09:26:55,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6608187134502924 [2022-12-13 09:26:55,559 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 3 states and 113 transitions. [2022-12-13 09:26:55,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 331 flow [2022-12-13 09:26:55,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:26:55,564 INFO L231 Difference]: Finished difference. Result has 63 places, 32 transitions, 76 flow [2022-12-13 09:26:55,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=63, PETRI_TRANSITIONS=32} [2022-12-13 09:26:55,567 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2022-12-13 09:26:55,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:26:55,568 INFO L89 Accepts]: Start accepts. Operand has 63 places, 32 transitions, 76 flow [2022-12-13 09:26:55,570 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:26:55,570 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:26:55,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 32 transitions, 76 flow [2022-12-13 09:26:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 76 flow [2022-12-13 09:26:55,574 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 09:26:55,574 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:26:55,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 75 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:26:55,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 76 flow [2022-12-13 09:26:55,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 09:26:55,641 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:26:55,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 09:26:55,642 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 76 flow [2022-12-13 09:26:55,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-12-13 09:26:55,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:26:55,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:26:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:26:55,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:26:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:26:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1017494860, now seen corresponding path program 1 times [2022-12-13 09:26:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:26:55,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19268878] [2022-12-13 09:26:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:26:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:26:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:26:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:26:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:26:55,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19268878] [2022-12-13 09:26:55,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19268878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:26:55,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:26:55,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:26:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978967088] [2022-12-13 09:26:55,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:26:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:26:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:26:55,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:26:55,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:26:55,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 09:26:55,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-12-13 09:26:55,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:26:55,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 09:26:55,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:26:56,240 INFO L130 PetriNetUnfolder]: 2038/3120 cut-off events. [2022-12-13 09:26:56,240 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-13 09:26:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6355 conditions, 3120 events. 2038/3120 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14848 event pairs, 758 based on Foata normal form. 90/2657 useless extension candidates. Maximal degree in co-relation 6345. Up to 2001 conditions per place. [2022-12-13 09:26:56,254 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 33 selfloop transitions, 2 changer transitions 1/43 dead transitions. [2022-12-13 09:26:56,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 170 flow [2022-12-13 09:26:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:26:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:26:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 09:26:56,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-13 09:26:56,256 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 76 flow. Second operand 3 states and 58 transitions. [2022-12-13 09:26:56,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 170 flow [2022-12-13 09:26:56,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:26:56,258 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 76 flow [2022-12-13 09:26:56,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-13 09:26:56,259 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -24 predicate places. [2022-12-13 09:26:56,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:26:56,259 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 76 flow [2022-12-13 09:26:56,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:26:56,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:26:56,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 76 flow [2022-12-13 09:26:56,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 09:26:56,263 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 09:26:56,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:26:56,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 73 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:26:56,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 09:26:56,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 09:26:56,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:26:56,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 09:26:56,398 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 74 flow [2022-12-13 09:26:56,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-12-13 09:26:56,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:26:56,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:26:56,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:26:56,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:26:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:26:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1479848246, now seen corresponding path program 1 times [2022-12-13 09:26:56,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:26:56,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315785992] [2022-12-13 09:26:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:26:56,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:26:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:26:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:26:56,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:26:56,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315785992] [2022-12-13 09:26:56,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315785992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:26:56,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:26:56,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:26:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49775936] [2022-12-13 09:26:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:26:56,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:26:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:26:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:26:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:26:56,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 09:26:56,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12-13 09:26:56,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:26:56,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 09:26:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:26:57,027 INFO L130 PetriNetUnfolder]: 1023/1717 cut-off events. [2022-12-13 09:26:57,027 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-13 09:26:57,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 1717 events. 1023/1717 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9447 event pairs, 305 based on Foata normal form. 8/1418 useless extension candidates. Maximal degree in co-relation 3529. Up to 1361 conditions per place. [2022-12-13 09:26:57,035 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2022-12-13 09:26:57,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 193 flow [2022-12-13 09:26:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:26:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:26:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 09:26:57,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 09:26:57,037 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 74 flow. Second operand 4 states and 76 transitions. [2022-12-13 09:26:57,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 193 flow [2022-12-13 09:26:57,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 187 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:26:57,038 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 103 flow [2022-12-13 09:26:57,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-13 09:26:57,039 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -23 predicate places. [2022-12-13 09:26:57,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:26:57,039 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 103 flow [2022-12-13 09:26:57,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:26:57,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:26:57,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 103 flow [2022-12-13 09:26:57,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 103 flow [2022-12-13 09:26:57,044 INFO L130 PetriNetUnfolder]: 3/44 cut-off events. [2022-12-13 09:26:57,044 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 09:26:57,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 44 events. 3/44 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 66. Up to 8 conditions per place. [2022-12-13 09:26:57,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 103 flow [2022-12-13 09:26:57,045 INFO L226 LiptonReduction]: Number of co-enabled transitions 564 [2022-12-13 09:26:57,090 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:26:57,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 09:26:57,091 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 103 flow [2022-12-13 09:26:57,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12-13 09:26:57,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:26:57,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:26:57,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:26:57,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:26:57,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:26:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash -916970988, now seen corresponding path program 1 times [2022-12-13 09:26:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:26:57,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136291721] [2022-12-13 09:26:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:26:57,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:26:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:26:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:26:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:26:57,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136291721] [2022-12-13 09:26:57,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136291721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:26:57,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:26:57,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:26:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554891213] [2022-12-13 09:26:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:26:57,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:26:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:26:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:26:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:26:57,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 09:26:57,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-12-13 09:26:57,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:26:57,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 09:26:57,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:26:57,887 INFO L130 PetriNetUnfolder]: 1614/2506 cut-off events. [2022-12-13 09:26:57,887 INFO L131 PetriNetUnfolder]: For 510/510 co-relation queries the response was YES. [2022-12-13 09:26:57,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5750 conditions, 2506 events. 1614/2506 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11878 event pairs, 264 based on Foata normal form. 5/2114 useless extension candidates. Maximal degree in co-relation 5737. Up to 1953 conditions per place. [2022-12-13 09:26:57,901 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 51 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-13 09:26:57,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 330 flow [2022-12-13 09:26:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:26:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:26:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 09:26:57,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2022-12-13 09:26:57,930 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 103 flow. Second operand 6 states and 106 transitions. [2022-12-13 09:26:57,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 330 flow [2022-12-13 09:26:57,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:26:57,932 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 199 flow [2022-12-13 09:26:57,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-13 09:26:57,933 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -15 predicate places. [2022-12-13 09:26:57,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:26:57,933 INFO L89 Accepts]: Start accepts. Operand has 51 places, 46 transitions, 199 flow [2022-12-13 09:26:57,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:26:57,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:26:57,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 199 flow [2022-12-13 09:26:57,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 199 flow [2022-12-13 09:26:57,949 INFO L130 PetriNetUnfolder]: 69/218 cut-off events. [2022-12-13 09:26:57,950 INFO L131 PetriNetUnfolder]: For 112/113 co-relation queries the response was YES. [2022-12-13 09:26:57,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 218 events. 69/218 cut-off events. For 112/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1187 event pairs, 13 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 494. Up to 78 conditions per place. [2022-12-13 09:26:57,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 199 flow [2022-12-13 09:26:57,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 09:26:57,983 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L798: Formula: (and (= v_~y$w_buff1~0_285 v_~y$w_buff0~0_319) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_36| |v_P2Thread1of1ForFork1_~arg#1.offset_36|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| 0)) (= v_~y$r_buff0_thd3~0_136 1) (= v_~z~0_43 v_~__unbuffered_p2_EAX~0_116) (= 2 v_~y$w_buff0~0_318) (= v_~y$r_buff0_thd0~0_312 v_~y$r_buff1_thd0~0_307) (= v_~y$w_buff0_used~0_451 1) (= v_~y$r_buff0_thd1~0_54 v_~y$r_buff1_thd1~0_48) (= |v_P2Thread1of1ForFork1_~arg#1.base_36| |v_P2Thread1of1ForFork1_#in~arg#1.base_36|) (= v_~y$w_buff0_used~0_452 v_~y$w_buff1_used~0_414) (= v_~y$r_buff0_thd2~0_121 v_~y$r_buff1_thd2~0_122) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_451 256) 0)) (not (= (mod v_~y$w_buff1_used~0_414 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (= v_~z~0_43 1) (= v_~y$r_buff0_thd3~0_137 v_~y$r_buff1_thd3~0_98)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_452, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_451, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_36|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_122, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, ~y$w_buff0~0=v_~y$w_buff0~0_318, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_36|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_116, ~z~0=v_~z~0_43, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_414} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [329] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~y$r_buff0_thd2~0_25 (ite .cse0 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff0_used~0_105 (ite .cse1 0 v_~y$w_buff0_used~0_106)) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92) (= v_~y~0_61 (ite .cse1 v_~y$w_buff0~0_44 (ite .cse4 v_~y$w_buff1~0_41 v_~y~0_62)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 09:26:58,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L798: Formula: (and (= v_~y$w_buff1~0_285 v_~y$w_buff0~0_319) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_36| |v_P2Thread1of1ForFork1_~arg#1.offset_36|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| 0)) (= v_~y$r_buff0_thd3~0_136 1) (= v_~z~0_43 v_~__unbuffered_p2_EAX~0_116) (= 2 v_~y$w_buff0~0_318) (= v_~y$r_buff0_thd0~0_312 v_~y$r_buff1_thd0~0_307) (= v_~y$w_buff0_used~0_451 1) (= v_~y$r_buff0_thd1~0_54 v_~y$r_buff1_thd1~0_48) (= |v_P2Thread1of1ForFork1_~arg#1.base_36| |v_P2Thread1of1ForFork1_#in~arg#1.base_36|) (= v_~y$w_buff0_used~0_452 v_~y$w_buff1_used~0_414) (= v_~y$r_buff0_thd2~0_121 v_~y$r_buff1_thd2~0_122) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_451 256) 0)) (not (= (mod v_~y$w_buff1_used~0_414 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (= v_~z~0_43 1) (= v_~y$r_buff0_thd3~0_137 v_~y$r_buff1_thd3~0_98)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_452, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_451, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_36|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_122, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, ~y$w_buff0~0=v_~y$w_buff0~0_318, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_36|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_116, ~z~0=v_~z~0_43, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_414} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [322] L748-->L751: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 09:26:58,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L798: Formula: (and (= v_~y$w_buff1~0_285 v_~y$w_buff0~0_319) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_36| |v_P2Thread1of1ForFork1_~arg#1.offset_36|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| 0)) (= v_~y$r_buff0_thd3~0_136 1) (= v_~z~0_43 v_~__unbuffered_p2_EAX~0_116) (= 2 v_~y$w_buff0~0_318) (= v_~y$r_buff0_thd0~0_312 v_~y$r_buff1_thd0~0_307) (= v_~y$w_buff0_used~0_451 1) (= v_~y$r_buff0_thd1~0_54 v_~y$r_buff1_thd1~0_48) (= |v_P2Thread1of1ForFork1_~arg#1.base_36| |v_P2Thread1of1ForFork1_#in~arg#1.base_36|) (= v_~y$w_buff0_used~0_452 v_~y$w_buff1_used~0_414) (= v_~y$r_buff0_thd2~0_121 v_~y$r_buff1_thd2~0_122) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_451 256) 0)) (not (= (mod v_~y$w_buff1_used~0_414 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (= v_~z~0_43 1) (= v_~y$r_buff0_thd3~0_137 v_~y$r_buff1_thd3~0_98)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_452, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_451, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_36|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_122, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, ~y$w_buff0~0=v_~y$w_buff0~0_318, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_36|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_116, ~z~0=v_~z~0_43, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_414} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [426] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_169 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_98 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_104 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_170 256) 0)))) (.cse1 (and .cse3 (not (= 0 (mod v_~y$w_buff1_used~0_149 256))))) (.cse2 (and .cse5 .cse4))) (and (= v_~y~0_104 (ite .cse0 v_~y$w_buff0~0_94 (ite .cse1 v_~y$w_buff1~0_77 v_~y~0_105))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= v_~y$w_buff0_used~0_169 (ite .cse0 0 v_~y$w_buff0_used~0_170)) (= (ite .cse2 0 v_~y$r_buff0_thd0~0_104) v_~y$r_buff0_thd0~0_103) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_148 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_103 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_98) v_~y$r_buff1_thd0~0_97) (= v_~y$w_buff1_used~0_148 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_149))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_170, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_94, ~y~0=v_~y~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_149, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_169, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_94, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ~y~0=v_~y~0_104, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_148, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:26:58,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:26:58,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 641 [2022-12-13 09:26:58,574 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 216 flow [2022-12-13 09:26:58,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-12-13 09:26:58,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:26:58,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:26:58,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:26:58,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:26:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:26:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 385973158, now seen corresponding path program 1 times [2022-12-13 09:26:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:26:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872796084] [2022-12-13 09:26:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:26:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:26:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:26:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:26:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:26:58,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872796084] [2022-12-13 09:26:58,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872796084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:26:58,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:26:58,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:26:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115394479] [2022-12-13 09:26:58,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:26:58,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:26:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:26:58,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:26:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:26:58,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:26:58,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 09:26:58,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:26:58,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:26:58,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:26:59,078 INFO L130 PetriNetUnfolder]: 1381/2216 cut-off events. [2022-12-13 09:26:59,078 INFO L131 PetriNetUnfolder]: For 1683/1683 co-relation queries the response was YES. [2022-12-13 09:26:59,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 2216 events. 1381/2216 cut-off events. For 1683/1683 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11353 event pairs, 418 based on Foata normal form. 10/1836 useless extension candidates. Maximal degree in co-relation 6144. Up to 1594 conditions per place. [2022-12-13 09:26:59,092 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 41 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2022-12-13 09:26:59,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 384 flow [2022-12-13 09:26:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:26:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:26:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 09:26:59,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5647058823529412 [2022-12-13 09:26:59,095 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 216 flow. Second operand 5 states and 96 transitions. [2022-12-13 09:26:59,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 384 flow [2022-12-13 09:26:59,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 376 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 09:26:59,099 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 266 flow [2022-12-13 09:26:59,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 09:26:59,099 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2022-12-13 09:26:59,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:26:59,100 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 266 flow [2022-12-13 09:26:59,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:26:59,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:26:59,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 266 flow [2022-12-13 09:26:59,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 266 flow [2022-12-13 09:26:59,119 INFO L130 PetriNetUnfolder]: 85/221 cut-off events. [2022-12-13 09:26:59,119 INFO L131 PetriNetUnfolder]: For 272/274 co-relation queries the response was YES. [2022-12-13 09:26:59,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 221 events. 85/221 cut-off events. For 272/274 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1132 event pairs, 6 based on Foata normal form. 1/175 useless extension candidates. Maximal degree in co-relation 665. Up to 89 conditions per place. [2022-12-13 09:26:59,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 266 flow [2022-12-13 09:26:59,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-13 09:26:59,123 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:26:59,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 09:26:59,124 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 266 flow [2022-12-13 09:26:59,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-12-13 09:26:59,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:26:59,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:26:59,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:26:59,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:26:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:26:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1552903119, now seen corresponding path program 1 times [2022-12-13 09:26:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:26:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306746770] [2022-12-13 09:26:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:26:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:26:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:26:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:26:59,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:26:59,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306746770] [2022-12-13 09:26:59,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306746770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:26:59,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:26:59,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:26:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137739446] [2022-12-13 09:26:59,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:26:59,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:26:59,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:26:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:26:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:26:59,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:26:59,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-12-13 09:26:59,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:26:59,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:26:59,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:26:59,768 INFO L130 PetriNetUnfolder]: 1611/2665 cut-off events. [2022-12-13 09:26:59,769 INFO L131 PetriNetUnfolder]: For 3579/3579 co-relation queries the response was YES. [2022-12-13 09:26:59,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7862 conditions, 2665 events. 1611/2665 cut-off events. For 3579/3579 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 14931 event pairs, 254 based on Foata normal form. 60/2269 useless extension candidates. Maximal degree in co-relation 7841. Up to 1456 conditions per place. [2022-12-13 09:26:59,791 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 50 selfloop transitions, 20 changer transitions 0/80 dead transitions. [2022-12-13 09:26:59,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 500 flow [2022-12-13 09:26:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:26:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:26:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-13 09:26:59,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 09:26:59,793 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 266 flow. Second operand 6 states and 119 transitions. [2022-12-13 09:26:59,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 500 flow [2022-12-13 09:26:59,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 470 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 09:26:59,801 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 330 flow [2022-12-13 09:26:59,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-12-13 09:26:59,803 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2022-12-13 09:26:59,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:26:59,803 INFO L89 Accepts]: Start accepts. Operand has 59 places, 52 transitions, 330 flow [2022-12-13 09:26:59,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:26:59,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:26:59,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 52 transitions, 330 flow [2022-12-13 09:26:59,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 330 flow [2022-12-13 09:26:59,826 INFO L130 PetriNetUnfolder]: 86/270 cut-off events. [2022-12-13 09:26:59,826 INFO L131 PetriNetUnfolder]: For 461/464 co-relation queries the response was YES. [2022-12-13 09:26:59,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 270 events. 86/270 cut-off events. For 461/464 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1665 event pairs, 4 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 832. Up to 89 conditions per place. [2022-12-13 09:26:59,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 52 transitions, 330 flow [2022-12-13 09:26:59,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 806 [2022-12-13 09:26:59,831 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:26:59,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 09:26:59,837 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 330 flow [2022-12-13 09:26:59,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-12-13 09:26:59,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:26:59,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:26:59,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:26:59,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:26:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:26:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1633458033, now seen corresponding path program 1 times [2022-12-13 09:26:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:26:59,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672173427] [2022-12-13 09:26:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:26:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:26:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:26:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:26:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:26:59,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672173427] [2022-12-13 09:26:59,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672173427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:26:59,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:26:59,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:26:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439755761] [2022-12-13 09:26:59,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:26:59,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:26:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:26:59,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:26:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:26:59,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 09:26:59,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-12-13 09:26:59,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:26:59,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 09:26:59,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:00,384 INFO L130 PetriNetUnfolder]: 2527/4096 cut-off events. [2022-12-13 09:27:00,384 INFO L131 PetriNetUnfolder]: For 11471/11530 co-relation queries the response was YES. [2022-12-13 09:27:00,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13563 conditions, 4096 events. 2527/4096 cut-off events. For 11471/11530 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 25145 event pairs, 616 based on Foata normal form. 371/3144 useless extension candidates. Maximal degree in co-relation 13540. Up to 3061 conditions per place. [2022-12-13 09:27:00,410 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 92 selfloop transitions, 20 changer transitions 7/130 dead transitions. [2022-12-13 09:27:00,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 130 transitions, 1052 flow [2022-12-13 09:27:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:27:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:27:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-12-13 09:27:00,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2022-12-13 09:27:00,412 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 330 flow. Second operand 5 states and 120 transitions. [2022-12-13 09:27:00,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 130 transitions, 1052 flow [2022-12-13 09:27:00,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 130 transitions, 998 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 09:27:00,422 INFO L231 Difference]: Finished difference. Result has 64 places, 70 transitions, 473 flow [2022-12-13 09:27:00,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=64, PETRI_TRANSITIONS=70} [2022-12-13 09:27:00,423 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2022-12-13 09:27:00,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:00,423 INFO L89 Accepts]: Start accepts. Operand has 64 places, 70 transitions, 473 flow [2022-12-13 09:27:00,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:00,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:00,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 70 transitions, 473 flow [2022-12-13 09:27:00,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 70 transitions, 473 flow [2022-12-13 09:27:00,530 INFO L130 PetriNetUnfolder]: 976/1825 cut-off events. [2022-12-13 09:27:00,531 INFO L131 PetriNetUnfolder]: For 3222/3887 co-relation queries the response was YES. [2022-12-13 09:27:00,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6425 conditions, 1825 events. 976/1825 cut-off events. For 3222/3887 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 13482 event pairs, 254 based on Foata normal form. 22/973 useless extension candidates. Maximal degree in co-relation 6401. Up to 1315 conditions per place. [2022-12-13 09:27:00,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 70 transitions, 473 flow [2022-12-13 09:27:00,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-13 09:27:00,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [402] L751-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_15| 0) (= |v_P0Thread1of1ForFork2_#res.offset_15| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-13 09:27:00,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [330] L773-->L776: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:27:00,607 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [363] L808-->P2FINAL: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P2Thread1of1ForFork1_#res#1.base_5| 0) (= |v_P2Thread1of1ForFork1_#res#1.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] [2022-12-13 09:27:00,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [405] L773-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_7| 0) (= |v_P1Thread1of1ForFork0_#res.base_7| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-13 09:27:00,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [340] L808-->L811: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:27:00,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [406] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_9| 0) (= |v_P1Thread1of1ForFork0_#res.base_9| 0) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-13 09:27:00,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [432] L808-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_251 (+ v_~__unbuffered_cnt~0_252 1)) (= |v_P2Thread1of1ForFork1_#res#1.offset_29| 0) (= |v_P2Thread1of1ForFork1_#res#1.base_29| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_252} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_251, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] [2022-12-13 09:27:00,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [323] L751-->L756: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:27:00,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [398] L751-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-13 09:27:00,807 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:27:00,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-13 09:27:00,808 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 503 flow [2022-12-13 09:27:00,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-12-13 09:27:00,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:00,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:00,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:27:00,809 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 441776682, now seen corresponding path program 1 times [2022-12-13 09:27:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470364713] [2022-12-13 09:27:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:27:00,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:00,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470364713] [2022-12-13 09:27:00,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470364713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:00,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:00,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:27:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604601988] [2022-12-13 09:27:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:00,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:27:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:27:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:27:00,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2022-12-13 09:27:00,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-12-13 09:27:00,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:00,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2022-12-13 09:27:00,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:01,283 INFO L130 PetriNetUnfolder]: 1799/3243 cut-off events. [2022-12-13 09:27:01,284 INFO L131 PetriNetUnfolder]: For 9935/9966 co-relation queries the response was YES. [2022-12-13 09:27:01,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14226 conditions, 3243 events. 1799/3243 cut-off events. For 9935/9966 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 22066 event pairs, 130 based on Foata normal form. 321/2454 useless extension candidates. Maximal degree in co-relation 14199. Up to 1855 conditions per place. [2022-12-13 09:27:01,304 INFO L137 encePairwiseOnDemand]: 21/43 looper letters, 78 selfloop transitions, 38 changer transitions 17/144 dead transitions. [2022-12-13 09:27:01,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 1250 flow [2022-12-13 09:27:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:27:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:27:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2022-12-13 09:27:01,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2022-12-13 09:27:01,305 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 503 flow. Second operand 6 states and 147 transitions. [2022-12-13 09:27:01,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 1250 flow [2022-12-13 09:27:01,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 144 transitions, 1220 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 09:27:01,327 INFO L231 Difference]: Finished difference. Result has 70 places, 85 transitions, 701 flow [2022-12-13 09:27:01,327 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=701, PETRI_PLACES=70, PETRI_TRANSITIONS=85} [2022-12-13 09:27:01,329 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 4 predicate places. [2022-12-13 09:27:01,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:01,329 INFO L89 Accepts]: Start accepts. Operand has 70 places, 85 transitions, 701 flow [2022-12-13 09:27:01,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:01,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:01,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 85 transitions, 701 flow [2022-12-13 09:27:01,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 85 transitions, 701 flow [2022-12-13 09:27:01,436 INFO L130 PetriNetUnfolder]: 601/1401 cut-off events. [2022-12-13 09:27:01,437 INFO L131 PetriNetUnfolder]: For 4464/6589 co-relation queries the response was YES. [2022-12-13 09:27:01,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6672 conditions, 1401 events. 601/1401 cut-off events. For 4464/6589 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 11378 event pairs, 38 based on Foata normal form. 10/734 useless extension candidates. Maximal degree in co-relation 6644. Up to 1054 conditions per place. [2022-12-13 09:27:01,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 85 transitions, 701 flow [2022-12-13 09:27:01,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 1216 [2022-12-13 09:27:01,455 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:27:01,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 09:27:01,457 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 85 transitions, 701 flow [2022-12-13 09:27:01,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-12-13 09:27:01,457 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:01,457 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:01,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:27:01,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1063667968, now seen corresponding path program 1 times [2022-12-13 09:27:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:01,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000561529] [2022-12-13 09:27:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:27:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:01,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000561529] [2022-12-13 09:27:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000561529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:01,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:01,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:27:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452036684] [2022-12-13 09:27:01,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:01,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:27:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:01,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:27:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:27:01,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2022-12-13 09:27:01,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 85 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-12-13 09:27:01,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:01,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2022-12-13 09:27:01,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:02,328 INFO L130 PetriNetUnfolder]: 2839/5244 cut-off events. [2022-12-13 09:27:02,328 INFO L131 PetriNetUnfolder]: For 20342/20738 co-relation queries the response was YES. [2022-12-13 09:27:02,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26465 conditions, 5244 events. 2839/5244 cut-off events. For 20342/20738 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 40965 event pairs, 151 based on Foata normal form. 196/4451 useless extension candidates. Maximal degree in co-relation 26434. Up to 2995 conditions per place. [2022-12-13 09:27:02,354 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 108 selfloop transitions, 9 changer transitions 84/222 dead transitions. [2022-12-13 09:27:02,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 222 transitions, 2321 flow [2022-12-13 09:27:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:27:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:27:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-12-13 09:27:02,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 09:27:02,355 INFO L175 Difference]: Start difference. First operand has 70 places, 85 transitions, 701 flow. Second operand 6 states and 162 transitions. [2022-12-13 09:27:02,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 222 transitions, 2321 flow [2022-12-13 09:27:02,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 222 transitions, 2031 flow, removed 113 selfloop flow, removed 1 redundant places. [2022-12-13 09:27:02,512 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 682 flow [2022-12-13 09:27:02,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2022-12-13 09:27:02,513 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2022-12-13 09:27:02,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:02,514 INFO L89 Accepts]: Start accepts. Operand has 78 places, 87 transitions, 682 flow [2022-12-13 09:27:02,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:02,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:02,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 87 transitions, 682 flow [2022-12-13 09:27:02,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 87 transitions, 682 flow [2022-12-13 09:27:02,690 INFO L130 PetriNetUnfolder]: 1037/2400 cut-off events. [2022-12-13 09:27:02,690 INFO L131 PetriNetUnfolder]: For 10670/10955 co-relation queries the response was YES. [2022-12-13 09:27:02,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10205 conditions, 2400 events. 1037/2400 cut-off events. For 10670/10955 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 21306 event pairs, 69 based on Foata normal form. 17/1228 useless extension candidates. Maximal degree in co-relation 10173. Up to 1039 conditions per place. [2022-12-13 09:27:02,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 87 transitions, 682 flow [2022-12-13 09:27:02,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-13 09:27:02,916 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:27:02,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-13 09:27:02,917 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 693 flow [2022-12-13 09:27:02,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-12-13 09:27:02,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:02,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:02,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:27:02,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash 920225638, now seen corresponding path program 1 times [2022-12-13 09:27:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:02,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492473400] [2022-12-13 09:27:02,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:27:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:27:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:27:03,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492473400] [2022-12-13 09:27:03,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492473400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:27:03,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:27:03,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:27:03,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181634248] [2022-12-13 09:27:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:27:03,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:27:03,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:27:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:27:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:27:03,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2022-12-13 09:27:03,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-12-13 09:27:03,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:27:03,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2022-12-13 09:27:03,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:27:03,530 INFO L130 PetriNetUnfolder]: 1764/3602 cut-off events. [2022-12-13 09:27:03,530 INFO L131 PetriNetUnfolder]: For 20013/20080 co-relation queries the response was YES. [2022-12-13 09:27:03,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16680 conditions, 3602 events. 1764/3602 cut-off events. For 20013/20080 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 29877 event pairs, 53 based on Foata normal form. 287/2616 useless extension candidates. Maximal degree in co-relation 16645. Up to 1062 conditions per place. [2022-12-13 09:27:03,549 INFO L137 encePairwiseOnDemand]: 22/43 looper letters, 51 selfloop transitions, 45 changer transitions 43/148 dead transitions. [2022-12-13 09:27:03,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 148 transitions, 1479 flow [2022-12-13 09:27:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:27:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 09:27:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-13 09:27:03,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2022-12-13 09:27:03,550 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 693 flow. Second operand 8 states and 155 transitions. [2022-12-13 09:27:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 148 transitions, 1479 flow [2022-12-13 09:27:03,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 1367 flow, removed 49 selfloop flow, removed 1 redundant places. [2022-12-13 09:27:03,607 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 643 flow [2022-12-13 09:27:03,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=643, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2022-12-13 09:27:03,608 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2022-12-13 09:27:03,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:27:03,608 INFO L89 Accepts]: Start accepts. Operand has 87 places, 77 transitions, 643 flow [2022-12-13 09:27:03,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:27:03,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:27:03,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 77 transitions, 643 flow [2022-12-13 09:27:03,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 77 transitions, 643 flow [2022-12-13 09:27:03,665 INFO L130 PetriNetUnfolder]: 211/968 cut-off events. [2022-12-13 09:27:03,665 INFO L131 PetriNetUnfolder]: For 2996/3212 co-relation queries the response was YES. [2022-12-13 09:27:03,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4337 conditions, 968 events. 211/968 cut-off events. For 2996/3212 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 10269 event pairs, 6 based on Foata normal form. 7/492 useless extension candidates. Maximal degree in co-relation 4301. Up to 409 conditions per place. [2022-12-13 09:27:03,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 77 transitions, 643 flow [2022-12-13 09:27:03,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 938 [2022-12-13 09:27:05,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] L763-->L766: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [491] $Ultimate##0-->L801: Formula: (and (= v_~y$w_buff0_used~0_553 1) (= v_~y$r_buff0_thd3~0_159 v_~y$r_buff1_thd3~0_114) (= v_~z~0_49 v_~__unbuffered_p2_EAX~0_132) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_553 256) 0)) (not (= (mod v_~y$w_buff1_used~0_512 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_42| |v_P2Thread1of1ForFork1_~arg#1.offset_42|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|) (= |v_P2Thread1of1ForFork1_~arg#1.base_42| |v_P2Thread1of1ForFork1_#in~arg#1.base_42|) (= v_~y$r_buff0_thd0~0_398 v_~y$r_buff1_thd0~0_391) (= 2 v_~y$w_buff0~0_373) (= v_~y$r_buff0_thd2~0_145 v_~y$r_buff1_thd2~0_146) (= v_~y$r_buff0_thd1~0_60 v_~y$r_buff1_thd1~0_54) (= v_~a~0_49 v_~__unbuffered_p2_EBX~0_135) (= v_~y$w_buff0_used~0_554 v_~y$w_buff1_used~0_512) (= v_~y$w_buff1~0_332 v_~y$w_buff0~0_374) (= v_~z~0_49 1) (= v_~y$r_buff0_thd3~0_158 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| 0))) InVars {~a~0=v_~a~0_49, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_42|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_554, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_159, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_398, ~y$w_buff0~0=v_~y$w_buff0~0_374, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_145, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_42|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_135, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_42|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_42|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_146, ~a~0=v_~a~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_114, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_42|, ~y$w_buff1~0=v_~y$w_buff1~0_332, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_158, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_398, ~y$w_buff0~0=v_~y$w_buff0~0_373, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_42|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_145, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_44|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_132, ~z~0=v_~z~0_49, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_391, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_512} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 09:27:06,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] L763-->L766: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [502] $Ultimate##0-->L808: Formula: (let ((.cse0 (= (mod v_~y$w_buff0_used~0_572 256) 0)) (.cse2 (not (= (mod v_~y$r_buff0_thd3~0_174 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_570 256) 0)))) (and (= (ite .cse0 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|) (= v_~y$r_buff0_thd1~0_67 v_~y$r_buff1_thd1~0_61) (= v_~y$w_buff0_used~0_570 0) (= 2 v_~y$w_buff0~0_388) (= v_~y$r_buff0_thd2~0_152 v_~y$r_buff1_thd2~0_153) (= v_~z~0_56 v_~__unbuffered_p2_EAX~0_139) (= v_~a~0_58 v_~__unbuffered_p2_EBX~0_142) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_51| 0)) (= (ite .cse1 0 1) v_~y$r_buff0_thd3~0_172) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_172 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_521 256) 0)) .cse2)) 0 v_~y$r_buff0_thd3~0_174) v_~y$r_buff1_thd3~0_121) (= v_~y$w_buff1~0_339 v_~y$w_buff0~0_389) (= (ite (or (and (not .cse0) .cse2) .cse1) 0 v_~y$w_buff0_used~0_572) v_~y$w_buff1_used~0_521) (= v_~z~0_56 1) (= v_~y~0_475 v_~y$w_buff0~0_388) (= v_~y$r_buff0_thd0~0_408 v_~y$r_buff1_thd0~0_400) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_51| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|) (= |v_P2Thread1of1ForFork1_~arg#1.base_49| |v_P2Thread1of1ForFork1_#in~arg#1.base_49|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_49| |v_P2Thread1of1ForFork1_~arg#1.offset_49|))) InVars {~a~0=v_~a~0_58, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_49|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_572, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_389, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_408, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_152, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_49|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_142, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_570, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_49|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_153, ~a~0=v_~a~0_58, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_61, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_121, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_49|, ~y$w_buff1~0=v_~y$w_buff1~0_339, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_408, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_152, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_139, ~z~0=v_~z~0_56, ~y~0=v_~y~0_475, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_400, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_521, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-13 09:27:06,285 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:27:06,286 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2678 [2022-12-13 09:27:06,286 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 534 flow [2022-12-13 09:27:06,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-12-13 09:27:06,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:27:06,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:27:06,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:27:06,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:27:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:27:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1644928601, now seen corresponding path program 1 times [2022-12-13 09:27:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:27:06,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119516124] [2022-12-13 09:27:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:27:06,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:27:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:42,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:42,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119516124] [2022-12-13 09:30:42,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119516124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:42,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:42,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:42,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325640479] [2022-12-13 09:30:42,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:42,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:30:42,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:42,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:30:42,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:30:42,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 09:30:42,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 534 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-12-13 09:30:42,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:42,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 09:30:42,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:42,917 INFO L130 PetriNetUnfolder]: 545/1049 cut-off events. [2022-12-13 09:30:42,917 INFO L131 PetriNetUnfolder]: For 8558/8621 co-relation queries the response was YES. [2022-12-13 09:30:42,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5447 conditions, 1049 events. 545/1049 cut-off events. For 8558/8621 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6027 event pairs, 25 based on Foata normal form. 68/859 useless extension candidates. Maximal degree in co-relation 5408. Up to 549 conditions per place. [2022-12-13 09:30:42,923 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 3 changer transitions 49/105 dead transitions. [2022-12-13 09:30:42,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 105 transitions, 1030 flow [2022-12-13 09:30:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:30:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-13 09:30:42,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2022-12-13 09:30:42,924 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 534 flow. Second operand 6 states and 95 transitions. [2022-12-13 09:30:42,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 105 transitions, 1030 flow [2022-12-13 09:30:42,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 105 transitions, 811 flow, removed 59 selfloop flow, removed 13 redundant places. [2022-12-13 09:30:42,938 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 277 flow [2022-12-13 09:30:42,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2022-12-13 09:30:42,939 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 4 predicate places. [2022-12-13 09:30:42,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:42,939 INFO L89 Accepts]: Start accepts. Operand has 70 places, 47 transitions, 277 flow [2022-12-13 09:30:42,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:42,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:42,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 47 transitions, 277 flow [2022-12-13 09:30:42,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 277 flow [2022-12-13 09:30:42,958 INFO L130 PetriNetUnfolder]: 122/296 cut-off events. [2022-12-13 09:30:42,958 INFO L131 PetriNetUnfolder]: For 926/935 co-relation queries the response was YES. [2022-12-13 09:30:42,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 296 events. 122/296 cut-off events. For 926/935 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1656 event pairs, 1 based on Foata normal form. 2/126 useless extension candidates. Maximal degree in co-relation 971. Up to 154 conditions per place. [2022-12-13 09:30:42,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 277 flow [2022-12-13 09:30:42,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 09:30:42,992 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:42,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 09:30:42,992 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 278 flow [2022-12-13 09:30:42,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-12-13 09:30:42,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:42,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:42,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:30:42,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1136909155, now seen corresponding path program 1 times [2022-12-13 09:30:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:42,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373319811] [2022-12-13 09:30:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:43,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:30:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:43,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:30:43,052 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:30:43,052 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:30:43,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:30:43,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:30:43,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:30:43,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:30:43,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:30:43,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:30:43,057 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:43,062 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:30:43,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:30:43,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:30:43 BasicIcfg [2022-12-13 09:30:43,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:30:43,126 INFO L158 Benchmark]: Toolchain (without parser) took 238482.93ms. Allocated memory was 210.8MB in the beginning and 864.0MB in the end (delta: 653.3MB). Free memory was 185.6MB in the beginning and 287.9MB in the end (delta: -102.4MB). Peak memory consumption was 551.9MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,127 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 187.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:30:43,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.40ms. Allocated memory is still 210.8MB. Free memory was 185.0MB in the beginning and 158.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.40ms. Allocated memory is still 210.8MB. Free memory was 158.3MB in the beginning and 155.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,127 INFO L158 Benchmark]: Boogie Preprocessor took 36.88ms. Allocated memory is still 210.8MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,127 INFO L158 Benchmark]: RCFGBuilder took 651.73ms. Allocated memory is still 210.8MB. Free memory was 154.1MB in the beginning and 121.1MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,127 INFO L158 Benchmark]: TraceAbstraction took 237233.24ms. Allocated memory was 210.8MB in the beginning and 864.0MB in the end (delta: 653.3MB). Free memory was 120.0MB in the beginning and 287.9MB in the end (delta: -167.9MB). Peak memory consumption was 485.9MB. Max. memory is 8.0GB. [2022-12-13 09:30:43,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 187.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 486.40ms. Allocated memory is still 210.8MB. Free memory was 185.0MB in the beginning and 158.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.40ms. Allocated memory is still 210.8MB. Free memory was 158.3MB in the beginning and 155.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.88ms. Allocated memory is still 210.8MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 651.73ms. Allocated memory is still 210.8MB. Free memory was 154.1MB in the beginning and 121.1MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 237233.24ms. Allocated memory was 210.8MB in the beginning and 864.0MB in the end (delta: 653.3MB). Free memory was 120.0MB in the beginning and 287.9MB in the end (delta: -167.9MB). Peak memory consumption was 485.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 116 PlacesBefore, 66 PlacesAfterwards, 108 TransitionsBefore, 57 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3267, independent: 3142, independent conditional: 3142, independent unconditional: 0, dependent: 125, dependent conditional: 125, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2090, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2090, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2090, independent: 2003, independent conditional: 0, independent unconditional: 2003, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 337, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3267, independent: 1104, independent conditional: 1104, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 2090, unknown conditional: 2090, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2093, Positive cache size: 2041, Positive conditional cache size: 2041, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 322, independent: 288, independent conditional: 288, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, independent: 229, independent conditional: 14, independent unconditional: 215, dependent: 23, dependent conditional: 3, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 252, independent: 229, independent conditional: 14, independent unconditional: 215, dependent: 23, dependent conditional: 3, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 252, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 23, dependent conditional: 3, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 47, dependent conditional: 14, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 322, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 252, unknown conditional: 252, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 229, Positive conditional cache size: 229, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 556, independent: 495, independent conditional: 495, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 17, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 17, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 556, independent: 466, independent conditional: 466, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 258, Positive conditional cache size: 258, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 37, independent conditional: 16, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 37, independent conditional: 16, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 11, independent conditional: 8, independent unconditional: 2, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 170, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 295, Positive conditional cache size: 295, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 51 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 17, independent unconditional: 11, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 17, independent unconditional: 11, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 12, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 323, Positive conditional cache size: 323, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 330, Positive conditional cache size: 330, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 806 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 337, Positive conditional cache size: 337, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 64 PlacesBefore, 63 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 1096 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 375, independent: 359, independent conditional: 359, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 36, independent conditional: 31, independent unconditional: 5, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 36, independent conditional: 31, independent unconditional: 5, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 375, independent: 323, independent conditional: 323, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 373, Positive conditional cache size: 373, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 375, Positive conditional cache size: 375, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 78 PlacesBefore, 78 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 72, independent conditional: 54, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, independent: 72, independent conditional: 54, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 73, unknown conditional: 73, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 447, Positive conditional cache size: 447, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 83 PlacesBefore, 79 PlacesAfterwards, 77 TransitionsBefore, 63 TransitionsAfterwards, 938 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 276, independent conditional: 276, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 170, independent conditional: 164, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 171, independent: 170, independent conditional: 164, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 171, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 171, unknown conditional: 171, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 617, Positive conditional cache size: 617, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 61 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 671, Positive cache size: 632, Positive conditional cache size: 632, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108, ((void *)0), P0, ((void *)0))=-2, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109, ((void *)0), P1, ((void *)0))=-1, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110, ((void *)0), P2, ((void *)0))=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 237.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1361 IncrementalHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 17 mSDtfsCounter, 1361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=701occurred in iteration=8, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 218.9s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 1450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:30:43,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...