/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:18:40,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:18:40,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:18:40,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:18:40,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:18:40,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:18:40,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:18:40,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:18:40,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:18:40,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:18:40,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:18:40,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:18:40,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:18:40,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:18:40,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:18:40,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:18:40,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:18:40,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:18:40,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:18:40,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:18:40,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:18:40,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:18:40,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:18:40,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:18:40,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:18:40,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:18:40,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:18:40,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:18:40,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:18:40,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:18:40,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:18:40,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:18:40,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:18:40,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:18:40,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:18:40,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:18:40,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:18:40,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:18:40,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:18:40,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:18:40,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:18:40,477 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:18:40,529 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:18:40,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:18:40,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:18:40,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:18:40,531 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:18:40,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:18:40,532 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:18:40,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:18:40,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:18:40,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:18:40,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:18:40,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:18:40,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:18:40,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:18:40,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:18:40,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:18:40,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:18:40,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:40,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:18:40,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:18:40,535 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-06 06:18:40,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:18:40,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:18:40,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:18:40,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:18:40,983 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:18:40,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2022-12-06 06:18:42,367 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:18:42,644 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:18:42,644 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2022-12-06 06:18:42,658 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed0e49ff/a11c9827a29a4a29a009241e557853b8/FLAG311a6deae [2022-12-06 06:18:42,671 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed0e49ff/a11c9827a29a4a29a009241e557853b8 [2022-12-06 06:18:42,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:18:42,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:18:42,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:42,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:18:42,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:18:42,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:42" (1/1) ... [2022-12-06 06:18:42,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430f0411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:42, skipping insertion in model container [2022-12-06 06:18:42,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:42" (1/1) ... [2022-12-06 06:18:42,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:18:42,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:18:42,857 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/mix015.oepc.i[945,958] [2022-12-06 06:18:43,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:43,076 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:18:43,096 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/mix015.oepc.i[945,958] [2022-12-06 06:18:43,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:43,195 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:18:43,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43 WrapperNode [2022-12-06 06:18:43,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:43,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:43,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:18:43,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:18:43,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,254 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-12-06 06:18:43,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:43,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:18:43,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:18:43,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:18:43,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:18:43,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:18:43,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:18:43,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:18:43,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:43,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:18:43,328 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-06 06:18:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:18:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:18:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:18:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:18:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:18:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:18:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:18:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:18:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:18:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:18:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:18:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:18:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:18:43,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:18:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:18:43,359 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:18:43,365 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-06 06:18:43,505 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:18:43,507 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:18:43,787 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:18:43,871 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:18:43,871 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:18:43,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:43 BoogieIcfgContainer [2022-12-06 06:18:43,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:18:43,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:18:43,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:18:43,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:18:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:18:42" (1/3) ... [2022-12-06 06:18:43,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3d9e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:43, skipping insertion in model container [2022-12-06 06:18:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (2/3) ... [2022-12-06 06:18:43,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3d9e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:43, skipping insertion in model container [2022-12-06 06:18:43,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:43" (3/3) ... [2022-12-06 06:18:43,881 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2022-12-06 06:18:43,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:18:43,898 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:18:43,898 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:18:43,977 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:18:44,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-06 06:18:44,080 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-06 06:18:44,080 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:44,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 06:18:44,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-06 06:18:44,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-06 06:18:44,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:44,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-06 06:18:44,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-06 06:18:44,167 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-06 06:18:44,167 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:44,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 06:18:44,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-06 06:18:44,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 2240 [2022-12-06 06:18:48,415 INFO L203 LiptonReduction]: Total number of compositions: 87 [2022-12-06 06:18:48,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:18:48,441 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;@7a21f3a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:18:48,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:18:48,443 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 06:18:48,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:48,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:48,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:18:48,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:48,458 INFO L85 PathProgramCache]: Analyzing trace with hash 479779, now seen corresponding path program 1 times [2022-12-06 06:18:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:48,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48113105] [2022-12-06 06:18:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:48,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:48,764 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-06 06:18:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:48,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48113105] [2022-12-06 06:18:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48113105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:48,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:48,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980664506] [2022-12-06 06:18:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:48,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:48,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:48,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:48,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:48,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:18:48,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:18:48,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:48,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:18:48,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:49,074 INFO L130 PetriNetUnfolder]: 1416/2139 cut-off events. [2022-12-06 06:18:49,075 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 06:18:49,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 2139 events. 1416/2139 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10282 event pairs, 778 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 4277. Up to 1781 conditions per place. [2022-12-06 06:18:49,086 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 2 changer transitions 8/46 dead transitions. [2022-12-06 06:18:49,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 191 flow [2022-12-06 06:18:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 06:18:49,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2022-12-06 06:18:49,095 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 59 transitions. [2022-12-06 06:18:49,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 191 flow [2022-12-06 06:18:49,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:18:49,098 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 58 flow [2022-12-06 06:18:49,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-06 06:18:49,102 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-06 06:18:49,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:49,102 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 58 flow [2022-12-06 06:18:49,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:49,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:49,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 58 flow [2022-12-06 06:18:49,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2022-12-06 06:18:49,109 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 06:18:49,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:49,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:18:49,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2022-12-06 06:18:49,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 06:18:49,346 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:18:49,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 06:18:49,347 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 06:18:49,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:18:49,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:49,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:49,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:18:49,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1796920123, now seen corresponding path program 1 times [2022-12-06 06:18:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:49,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351929277] [2022-12-06 06:18:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:49,563 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-06 06:18:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:49,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351929277] [2022-12-06 06:18:49,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351929277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:49,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:49,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668000] [2022-12-06 06:18:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:49,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:49,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:18:49,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 06:18:49,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:49,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:18:49,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:49,769 INFO L130 PetriNetUnfolder]: 1387/2044 cut-off events. [2022-12-06 06:18:49,769 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-06 06:18:49,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4282 conditions, 2044 events. 1387/2044 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8458 event pairs, 703 based on Foata normal form. 4/2048 useless extension candidates. Maximal degree in co-relation 4272. Up to 2015 conditions per place. [2022-12-06 06:18:49,778 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-06 06:18:49,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 148 flow [2022-12-06 06:18:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:18:49,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-06 06:18:49,780 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:18:49,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 148 flow [2022-12-06 06:18:49,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:49,781 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2022-12-06 06:18:49,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-06 06:18:49,782 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-12-06 06:18:49,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:49,782 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 76 flow [2022-12-06 06:18:49,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:49,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:49,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 76 flow [2022-12-06 06:18:49,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 76 flow [2022-12-06 06:18:49,789 INFO L130 PetriNetUnfolder]: 14/67 cut-off events. [2022-12-06 06:18:49,789 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:49,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 67 events. 14/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 211 event pairs, 6 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 100. Up to 29 conditions per place. [2022-12-06 06:18:49,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 76 flow [2022-12-06 06:18:49,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 06:18:49,830 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:49,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:18:49,831 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2022-12-06 06:18:49,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 06:18:49,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:49,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:49,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:18:49,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash -130050534, now seen corresponding path program 1 times [2022-12-06 06:18:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:49,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732768152] [2022-12-06 06:18:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:50,008 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-06 06:18:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:50,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732768152] [2022-12-06 06:18:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732768152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:50,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:50,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701500923] [2022-12-06 06:18:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:50,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:50,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:18:50,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 06:18:50,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:50,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:18:50,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:50,217 INFO L130 PetriNetUnfolder]: 1269/1880 cut-off events. [2022-12-06 06:18:50,217 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-12-06 06:18:50,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4276 conditions, 1880 events. 1269/1880 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7436 event pairs, 405 based on Foata normal form. 46/1926 useless extension candidates. Maximal degree in co-relation 4265. Up to 1316 conditions per place. [2022-12-06 06:18:50,228 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 06:18:50,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2022-12-06 06:18:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:18:50,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:18:50,231 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:18:50,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2022-12-06 06:18:50,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:18:50,233 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2022-12-06 06:18:50,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-06 06:18:50,234 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -6 predicate places. [2022-12-06 06:18:50,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:50,234 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 83 flow [2022-12-06 06:18:50,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:50,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:50,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 83 flow [2022-12-06 06:18:50,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 83 flow [2022-12-06 06:18:50,240 INFO L130 PetriNetUnfolder]: 9/48 cut-off events. [2022-12-06 06:18:50,240 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 06:18:50,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 48 events. 9/48 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 82. Up to 21 conditions per place. [2022-12-06 06:18:50,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 83 flow [2022-12-06 06:18:50,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 06:18:50,253 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:50,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:18:50,254 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2022-12-06 06:18:50,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 06:18:50,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:50,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:50,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:18:50,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:50,255 INFO L85 PathProgramCache]: Analyzing trace with hash 262100328, now seen corresponding path program 1 times [2022-12-06 06:18:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:50,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488621023] [2022-12-06 06:18:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:50,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:50,381 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-06 06:18:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488621023] [2022-12-06 06:18:50,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488621023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:50,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:50,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:50,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473134160] [2022-12-06 06:18:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:50,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:50,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:50,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:50,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:18:50,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 06:18:50,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:50,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:18:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:50,552 INFO L130 PetriNetUnfolder]: 1218/1809 cut-off events. [2022-12-06 06:18:50,552 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2022-12-06 06:18:50,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1809 events. 1218/1809 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7280 event pairs, 678 based on Foata normal form. 20/1829 useless extension candidates. Maximal degree in co-relation 4277. Up to 1581 conditions per place. [2022-12-06 06:18:50,561 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-06 06:18:50,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 204 flow [2022-12-06 06:18:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:18:50,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 06:18:50,562 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:18:50,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 204 flow [2022-12-06 06:18:50,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:50,564 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2022-12-06 06:18:50,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-06 06:18:50,564 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2022-12-06 06:18:50,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:50,564 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 88 flow [2022-12-06 06:18:50,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:50,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:50,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 88 flow [2022-12-06 06:18:50,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 88 flow [2022-12-06 06:18:50,570 INFO L130 PetriNetUnfolder]: 6/43 cut-off events. [2022-12-06 06:18:50,570 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:18:50,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 43 events. 6/43 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 76. Up to 16 conditions per place. [2022-12-06 06:18:50,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 88 flow [2022-12-06 06:18:50,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 06:18:50,571 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:50,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:18:50,572 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2022-12-06 06:18:50,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 06:18:50,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:50,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:50,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:18:50,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash -464716973, now seen corresponding path program 1 times [2022-12-06 06:18:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:50,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768570082] [2022-12-06 06:18:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:50,724 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-06 06:18:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:50,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768570082] [2022-12-06 06:18:50,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768570082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:50,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:50,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434836500] [2022-12-06 06:18:50,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:50,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:50,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:50,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:50,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 06:18:50,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-06 06:18:50,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:50,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 06:18:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:50,932 INFO L130 PetriNetUnfolder]: 653/1083 cut-off events. [2022-12-06 06:18:50,932 INFO L131 PetriNetUnfolder]: For 420/423 co-relation queries the response was YES. [2022-12-06 06:18:50,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 1083 events. 653/1083 cut-off events. For 420/423 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5340 event pairs, 114 based on Foata normal form. 113/1177 useless extension candidates. Maximal degree in co-relation 2613. Up to 575 conditions per place. [2022-12-06 06:18:50,940 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 45 selfloop transitions, 8 changer transitions 3/61 dead transitions. [2022-12-06 06:18:50,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 61 transitions, 296 flow [2022-12-06 06:18:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:18:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:18:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 06:18:50,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2022-12-06 06:18:50,942 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 5 states and 71 transitions. [2022-12-06 06:18:50,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 61 transitions, 296 flow [2022-12-06 06:18:50,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 61 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:50,945 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 140 flow [2022-12-06 06:18:50,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-06 06:18:50,946 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-06 06:18:50,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:50,946 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 140 flow [2022-12-06 06:18:50,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:50,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:50,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 140 flow [2022-12-06 06:18:50,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 140 flow [2022-12-06 06:18:50,956 INFO L130 PetriNetUnfolder]: 33/123 cut-off events. [2022-12-06 06:18:50,957 INFO L131 PetriNetUnfolder]: For 83/93 co-relation queries the response was YES. [2022-12-06 06:18:50,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 123 events. 33/123 cut-off events. For 83/93 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 589 event pairs, 18 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 320. Up to 58 conditions per place. [2022-12-06 06:18:50,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 140 flow [2022-12-06 06:18:50,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 06:18:50,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] L855-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_40 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (= v_~main$tmp_guard0~0_40 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_131 3) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_15|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [461] L797-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_21| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_21|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-06 06:18:50,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] L855-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_40 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (= v_~main$tmp_guard0~0_40 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_131 3) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_15|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [451] L777-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P0Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_7|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 06:18:51,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] L855-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_40 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (= v_~main$tmp_guard0~0_40 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_131 3) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_15|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [407] L833-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 06:18:51,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:51,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 06:18:51,081 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 146 flow [2022-12-06 06:18:51,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-06 06:18:51,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:51,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:51,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:18:51,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash 914854807, now seen corresponding path program 1 times [2022-12-06 06:18:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:51,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408138981] [2022-12-06 06:18:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:51,235 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-06 06:18:51,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:51,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408138981] [2022-12-06 06:18:51,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408138981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:51,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:51,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:18:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765706484] [2022-12-06 06:18:51,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:51,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:51,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:51,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:51,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:51,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:18:51,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-06 06:18:51,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:51,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:18:51,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:51,426 INFO L130 PetriNetUnfolder]: 392/706 cut-off events. [2022-12-06 06:18:51,426 INFO L131 PetriNetUnfolder]: For 644/644 co-relation queries the response was YES. [2022-12-06 06:18:51,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 706 events. 392/706 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3390 event pairs, 73 based on Foata normal form. 56/751 useless extension candidates. Maximal degree in co-relation 2147. Up to 225 conditions per place. [2022-12-06 06:18:51,431 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 45 selfloop transitions, 13 changer transitions 12/75 dead transitions. [2022-12-06 06:18:51,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 75 transitions, 424 flow [2022-12-06 06:18:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:18:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:18:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 06:18:51,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2022-12-06 06:18:51,435 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 146 flow. Second operand 6 states and 89 transitions. [2022-12-06 06:18:51,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 75 transitions, 424 flow [2022-12-06 06:18:51,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 418 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 06:18:51,442 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 227 flow [2022-12-06 06:18:51,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-06 06:18:51,444 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2022-12-06 06:18:51,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:51,444 INFO L89 Accepts]: Start accepts. Operand has 47 places, 37 transitions, 227 flow [2022-12-06 06:18:51,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:51,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:51,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 227 flow [2022-12-06 06:18:51,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 227 flow [2022-12-06 06:18:51,457 INFO L130 PetriNetUnfolder]: 24/106 cut-off events. [2022-12-06 06:18:51,457 INFO L131 PetriNetUnfolder]: For 254/267 co-relation queries the response was YES. [2022-12-06 06:18:51,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 106 events. 24/106 cut-off events. For 254/267 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 4 based on Foata normal form. 2/104 useless extension candidates. Maximal degree in co-relation 376. Up to 56 conditions per place. [2022-12-06 06:18:51,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 227 flow [2022-12-06 06:18:51,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 06:18:51,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:51,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:18:51,492 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 219 flow [2022-12-06 06:18:51,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-06 06:18:51,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:51,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:51,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:18:51,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1673111195, now seen corresponding path program 1 times [2022-12-06 06:18:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:51,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916963340] [2022-12-06 06:18:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:51,925 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-06 06:18:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:51,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916963340] [2022-12-06 06:18:51,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916963340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:51,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:51,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:18:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106578393] [2022-12-06 06:18:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:51,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:51,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:18:51,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 219 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:18:51,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:51,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:18:51,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:52,287 INFO L130 PetriNetUnfolder]: 730/1295 cut-off events. [2022-12-06 06:18:52,288 INFO L131 PetriNetUnfolder]: For 2979/2979 co-relation queries the response was YES. [2022-12-06 06:18:52,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 1295 events. 730/1295 cut-off events. For 2979/2979 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6494 event pairs, 84 based on Foata normal form. 8/1303 useless extension candidates. Maximal degree in co-relation 4610. Up to 592 conditions per place. [2022-12-06 06:18:52,294 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 72 selfloop transitions, 17 changer transitions 35/124 dead transitions. [2022-12-06 06:18:52,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 124 transitions, 1033 flow [2022-12-06 06:18:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:18:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:18:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 06:18:52,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 06:18:52,296 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 219 flow. Second operand 6 states and 93 transitions. [2022-12-06 06:18:52,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 124 transitions, 1033 flow [2022-12-06 06:18:52,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 907 flow, removed 45 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:52,307 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 266 flow [2022-12-06 06:18:52,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-06 06:18:52,308 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2022-12-06 06:18:52,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:52,308 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 266 flow [2022-12-06 06:18:52,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:52,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:52,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 266 flow [2022-12-06 06:18:52,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 266 flow [2022-12-06 06:18:52,329 INFO L130 PetriNetUnfolder]: 82/245 cut-off events. [2022-12-06 06:18:52,329 INFO L131 PetriNetUnfolder]: For 545/564 co-relation queries the response was YES. [2022-12-06 06:18:52,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 245 events. 82/245 cut-off events. For 545/564 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1258 event pairs, 10 based on Foata normal form. 7/243 useless extension candidates. Maximal degree in co-relation 866. Up to 68 conditions per place. [2022-12-06 06:18:52,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 266 flow [2022-12-06 06:18:52,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-06 06:18:52,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L810-->L826: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd3~0_58 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and (= (mod v_~a$w_buff1_used~0_113 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0)) (.cse7 (and .cse11 .cse6))) (let ((.cse1 (or .cse9 .cse12 .cse7)) (.cse2 (and .cse8 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~a~0_88 (ite .cse2 v_~a$w_buff0~0_56 v_~a$w_buff1~0_53))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= 0 (mod v_~a$w_buff1_used~0_112 256))) (.cse4 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a$w_buff0_used~0_133 (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse2 0 v_~a$w_buff0_used~0_134)))) (= v_~a$flush_delayed~0_19 0) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_18 .cse3)) (= v_~a$r_buff0_thd3~0_57 (ite .cse0 v_~a$r_buff0_thd3~0_58 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~a$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd3~0_58)))) (= v_~a$w_buff0~0_56 v_~a$w_buff0~0_55) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_13) (= v_~__unbuffered_p2_EBX~0_10 .cse3) (= (ite .cse0 v_~a$w_buff1_used~0_113 (ite (or .cse9 .cse4 .cse7) v_~a$w_buff1_used~0_113 0)) v_~a$w_buff1_used~0_112) (= v_~a~0_88 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_53 v_~a$w_buff1~0_52) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~a$r_buff1_thd3~0_57 (ite .cse0 v_~a$r_buff1_thd3~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd3~0_57 256) 0))) (or (and .cse5 .cse10) (and .cse10 .cse11) .cse4)) v_~a$r_buff1_thd3~0_58 0)))))))) InVars {~a~0=v_~a~0_88, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_58, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_113} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_57, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$flush_delayed~0=v_~a$flush_delayed~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0] and [349] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 06:18:52,827 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:18:52,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 520 [2022-12-06 06:18:52,828 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 268 flow [2022-12-06 06:18:52,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-06 06:18:52,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:52,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:52,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:18:52,829 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:52,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:52,829 INFO L85 PathProgramCache]: Analyzing trace with hash -263191195, now seen corresponding path program 2 times [2022-12-06 06:18:52,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:52,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069006692] [2022-12-06 06:18:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:52,990 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-06 06:18:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:52,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069006692] [2022-12-06 06:18:52,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069006692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:52,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:52,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:18:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051355780] [2022-12-06 06:18:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:52,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:18:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:18:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:18:52,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:18:52,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-06 06:18:52,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:52,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:18:52,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:53,174 INFO L130 PetriNetUnfolder]: 313/619 cut-off events. [2022-12-06 06:18:53,175 INFO L131 PetriNetUnfolder]: For 1268/1268 co-relation queries the response was YES. [2022-12-06 06:18:53,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 619 events. 313/619 cut-off events. For 1268/1268 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3071 event pairs, 67 based on Foata normal form. 32/642 useless extension candidates. Maximal degree in co-relation 2329. Up to 222 conditions per place. [2022-12-06 06:18:53,179 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 58 selfloop transitions, 11 changer transitions 13/88 dead transitions. [2022-12-06 06:18:53,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 646 flow [2022-12-06 06:18:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:18:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:18:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 06:18:53,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2022-12-06 06:18:53,180 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 268 flow. Second operand 7 states and 86 transitions. [2022-12-06 06:18:53,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 646 flow [2022-12-06 06:18:53,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 615 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 06:18:53,183 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 277 flow [2022-12-06 06:18:53,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2022-12-06 06:18:53,184 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2022-12-06 06:18:53,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:53,184 INFO L89 Accepts]: Start accepts. Operand has 56 places, 42 transitions, 277 flow [2022-12-06 06:18:53,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:53,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:53,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 42 transitions, 277 flow [2022-12-06 06:18:53,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 277 flow [2022-12-06 06:18:53,200 INFO L130 PetriNetUnfolder]: 59/196 cut-off events. [2022-12-06 06:18:53,200 INFO L131 PetriNetUnfolder]: For 361/382 co-relation queries the response was YES. [2022-12-06 06:18:53,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 196 events. 59/196 cut-off events. For 361/382 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 988 event pairs, 5 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 718. Up to 68 conditions per place. [2022-12-06 06:18:53,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 277 flow [2022-12-06 06:18:53,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 06:18:53,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:53,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-06 06:18:53,442 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 277 flow [2022-12-06 06:18:53,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-06 06:18:53,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:53,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:53,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:18:53,442 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash 690609877, now seen corresponding path program 1 times [2022-12-06 06:18:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:53,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619247230] [2022-12-06 06:18:53,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:53,622 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-06 06:18:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:53,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619247230] [2022-12-06 06:18:53,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619247230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:53,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:53,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475421204] [2022-12-06 06:18:53,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:53,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:53,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:53,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:53,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:18:53,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 277 flow. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-06 06:18:53,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:53,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:18:53,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:53,842 INFO L130 PetriNetUnfolder]: 583/1048 cut-off events. [2022-12-06 06:18:53,843 INFO L131 PetriNetUnfolder]: For 2119/2119 co-relation queries the response was YES. [2022-12-06 06:18:53,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 1048 events. 583/1048 cut-off events. For 2119/2119 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5067 event pairs, 56 based on Foata normal form. 1/1049 useless extension candidates. Maximal degree in co-relation 4183. Up to 609 conditions per place. [2022-12-06 06:18:53,850 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 64 selfloop transitions, 13 changer transitions 12/89 dead transitions. [2022-12-06 06:18:53,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 739 flow [2022-12-06 06:18:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:18:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:18:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 06:18:53,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 06:18:53,852 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 277 flow. Second operand 5 states and 56 transitions. [2022-12-06 06:18:53,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 739 flow [2022-12-06 06:18:53,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 641 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-06 06:18:53,862 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 307 flow [2022-12-06 06:18:53,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-06 06:18:53,862 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-12-06 06:18:53,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:53,862 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 307 flow [2022-12-06 06:18:53,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:53,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:53,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 307 flow [2022-12-06 06:18:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 307 flow [2022-12-06 06:18:53,887 INFO L130 PetriNetUnfolder]: 109/299 cut-off events. [2022-12-06 06:18:53,887 INFO L131 PetriNetUnfolder]: For 395/403 co-relation queries the response was YES. [2022-12-06 06:18:53,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 299 events. 109/299 cut-off events. For 395/403 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1617 event pairs, 13 based on Foata normal form. 1/285 useless extension candidates. Maximal degree in co-relation 923. Up to 80 conditions per place. [2022-12-06 06:18:53,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 307 flow [2022-12-06 06:18:53,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 06:18:53,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] L810-->L826: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd3~0_58 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse6)) (.cse9 (and (= (mod v_~a$w_buff1_used~0_113 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0)) (.cse7 (and .cse11 .cse6))) (let ((.cse1 (or .cse9 .cse12 .cse7)) (.cse2 (and .cse8 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~a~0_88 (ite .cse2 v_~a$w_buff0~0_56 v_~a$w_buff1~0_53))) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= 0 (mod v_~a$w_buff1_used~0_112 256))) (.cse4 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a$w_buff0_used~0_133 (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse2 0 v_~a$w_buff0_used~0_134)))) (= v_~a$flush_delayed~0_19 0) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_18 .cse3)) (= v_~a$r_buff0_thd3~0_57 (ite .cse0 v_~a$r_buff0_thd3~0_58 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~a$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~a$r_buff0_thd3~0_58)))) (= v_~a$w_buff0~0_56 v_~a$w_buff0~0_55) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_13) (= v_~__unbuffered_p2_EBX~0_10 .cse3) (= (ite .cse0 v_~a$w_buff1_used~0_113 (ite (or .cse9 .cse4 .cse7) v_~a$w_buff1_used~0_113 0)) v_~a$w_buff1_used~0_112) (= v_~a~0_88 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_53 v_~a$w_buff1~0_52) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~a$r_buff1_thd3~0_57 (ite .cse0 v_~a$r_buff1_thd3~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd3~0_57 256) 0))) (or (and .cse5 .cse10) (and .cse10 .cse11) .cse4)) v_~a$r_buff1_thd3~0_58 0)))))))) InVars {~a~0=v_~a~0_88, ~a$w_buff1~0=v_~a$w_buff1~0_53, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_58, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_113} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_57, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$flush_delayed~0=v_~a$flush_delayed~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0] and [349] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 06:18:54,366 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:18:54,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 505 [2022-12-06 06:18:54,367 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 319 flow [2022-12-06 06:18:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-06 06:18:54,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:54,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:54,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:18:54,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2051297149, now seen corresponding path program 1 times [2022-12-06 06:18:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:54,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053186729] [2022-12-06 06:18:54,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:54,528 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-06 06:18:54,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:54,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053186729] [2022-12-06 06:18:54,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053186729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:54,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:54,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:54,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105336621] [2022-12-06 06:18:54,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:54,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:54,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:54,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:18:54,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 319 flow. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-06 06:18:54,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:54,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:18:54,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:54,694 INFO L130 PetriNetUnfolder]: 660/1170 cut-off events. [2022-12-06 06:18:54,695 INFO L131 PetriNetUnfolder]: For 2664/2664 co-relation queries the response was YES. [2022-12-06 06:18:54,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4592 conditions, 1170 events. 660/1170 cut-off events. For 2664/2664 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5907 event pairs, 85 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 4566. Up to 698 conditions per place. [2022-12-06 06:18:54,701 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 56 selfloop transitions, 18 changer transitions 20/94 dead transitions. [2022-12-06 06:18:54,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 758 flow [2022-12-06 06:18:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:18:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:18:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:18:54,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2022-12-06 06:18:54,702 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 319 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:18:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 758 flow [2022-12-06 06:18:54,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 94 transitions, 737 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 06:18:54,710 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 413 flow [2022-12-06 06:18:54,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=413, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-06 06:18:54,711 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2022-12-06 06:18:54,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:54,711 INFO L89 Accepts]: Start accepts. Operand has 54 places, 51 transitions, 413 flow [2022-12-06 06:18:54,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:54,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:54,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 413 flow [2022-12-06 06:18:54,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 413 flow [2022-12-06 06:18:54,739 INFO L130 PetriNetUnfolder]: 134/389 cut-off events. [2022-12-06 06:18:54,739 INFO L131 PetriNetUnfolder]: For 719/764 co-relation queries the response was YES. [2022-12-06 06:18:54,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 389 events. 134/389 cut-off events. For 719/764 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2397 event pairs, 12 based on Foata normal form. 7/381 useless extension candidates. Maximal degree in co-relation 1326. Up to 98 conditions per place. [2022-12-06 06:18:54,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 51 transitions, 413 flow [2022-12-06 06:18:54,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 06:18:54,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:54,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 06:18:54,744 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 413 flow [2022-12-06 06:18:54,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-06 06:18:54,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:54,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:54,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:18:54,744 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1752479442, now seen corresponding path program 1 times [2022-12-06 06:18:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:54,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277764544] [2022-12-06 06:18:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:55,338 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-06 06:18:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277764544] [2022-12-06 06:18:55,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277764544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:55,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:55,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:18:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287123569] [2022-12-06 06:18:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:55,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:18:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:55,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:18:55,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:18:55,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 06:18:55,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 413 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-06 06:18:55,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:55,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 06:18:55,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:55,524 INFO L130 PetriNetUnfolder]: 447/904 cut-off events. [2022-12-06 06:18:55,524 INFO L131 PetriNetUnfolder]: For 2094/2173 co-relation queries the response was YES. [2022-12-06 06:18:55,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 904 events. 447/904 cut-off events. For 2094/2173 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5150 event pairs, 54 based on Foata normal form. 23/918 useless extension candidates. Maximal degree in co-relation 3543. Up to 468 conditions per place. [2022-12-06 06:18:55,529 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 47 selfloop transitions, 10 changer transitions 19/90 dead transitions. [2022-12-06 06:18:55,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 767 flow [2022-12-06 06:18:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:18:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:18:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 06:18:55,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-06 06:18:55,530 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 413 flow. Second operand 6 states and 62 transitions. [2022-12-06 06:18:55,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 767 flow [2022-12-06 06:18:55,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 767 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:18:55,540 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 442 flow [2022-12-06 06:18:55,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2022-12-06 06:18:55,541 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2022-12-06 06:18:55,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:55,541 INFO L89 Accepts]: Start accepts. Operand has 60 places, 51 transitions, 442 flow [2022-12-06 06:18:55,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:55,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:55,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 51 transitions, 442 flow [2022-12-06 06:18:55,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 442 flow [2022-12-06 06:18:55,569 INFO L130 PetriNetUnfolder]: 127/378 cut-off events. [2022-12-06 06:18:55,569 INFO L131 PetriNetUnfolder]: For 953/992 co-relation queries the response was YES. [2022-12-06 06:18:55,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 378 events. 127/378 cut-off events. For 953/992 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2349 event pairs, 12 based on Foata normal form. 5/368 useless extension candidates. Maximal degree in co-relation 1362. Up to 94 conditions per place. [2022-12-06 06:18:55,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 442 flow [2022-12-06 06:18:55,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 06:18:56,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L770-->P0EXIT: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_182 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_591 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_243 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_519 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_592 256) 0))))) (and (= (ite .cse0 0 v_~a$r_buff0_thd1~0_243) v_~a$r_buff0_thd1~0_242) (= |v_P0Thread1of1ForFork1_#res#1.base_19| 0) (= |v_P0Thread1of1ForFork1_#res#1.offset_19| 0) (= (ite (or .cse1 .cse0) 0 v_~a$w_buff1_used~0_519) v_~a$w_buff1_used~0_518) (= v_~__unbuffered_cnt~0_195 (+ v_~__unbuffered_cnt~0_196 1)) (= v_~a~0_466 (ite .cse2 v_~a$w_buff0~0_329 (ite .cse1 v_~a$w_buff1~0_274 v_~a~0_467))) (= (ite .cse2 0 v_~a$w_buff0_used~0_592) v_~a$w_buff0_used~0_591) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_518 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_242 256) 0)))) 0 v_~a$r_buff1_thd1~0_182) v_~a$r_buff1_thd1~0_181)))) InVars {~a~0=v_~a~0_467, ~a$w_buff1~0=v_~a$w_buff1~0_274, ~a$w_buff0~0=v_~a$w_buff0~0_329, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_182, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_592, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_196, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_243, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_519} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_19|, ~a~0=v_~a~0_466, ~a$w_buff1~0=v_~a$w_buff1~0_274, ~a$w_buff0~0=v_~a$w_buff0~0_329, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_181, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_19|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_591, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_242, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_518} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, ~a~0, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res#1.base, ~a$w_buff0_used~0, ~__unbuffered_cnt~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [481] L855-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd0~0_200 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_197 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_529 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_461 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_530 256) 0))))) (and (= (mod v_~main$tmp_guard1~0_90 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_461) v_~a$w_buff1_used~0_460) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_78| (mod v_~main$tmp_guard0~0_66 256)) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_84 1) (= v_~__unbuffered_p0_EBX~0_74 0) (= v_~__unbuffered_p2_EAX~0_70 1) (= v_~__unbuffered_p2_EBX~0_98 0) (= v_~__unbuffered_p1_EAX~0_76 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_90) (= (ite .cse1 0 v_~a$r_buff0_thd0~0_197) v_~a$r_buff0_thd0~0_196) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= v_~a~0_408 (ite .cse2 v_~a$w_buff0~0_297 (ite .cse0 v_~a$w_buff1~0_246 v_~a~0_409))) (= (ite .cse2 0 v_~a$w_buff0_used~0_530) v_~a$w_buff0_used~0_529) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_106| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_106| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_78|) (= v_~main$tmp_guard0~0_66 (ite (= (ite (= v_~__unbuffered_cnt~0_191 3) 1 0) 0) 0 1)) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_460 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd0~0_196 256) 0)))) 0 v_~a$r_buff1_thd0~0_200) v_~a$r_buff1_thd0~0_199)))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_74, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_98, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_530, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_197, ~a~0=v_~a~0_409, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_84, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~a$w_buff1~0=v_~a$w_buff1~0_246, ~a$w_buff0~0=v_~a$w_buff0~0_297, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_200, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_461} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_74, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_98, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_53|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_529, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_90, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_66, ~a~0=v_~a~0_408, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_84, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~a$w_buff1~0=v_~a$w_buff1~0_246, ~a$w_buff0~0=v_~a$w_buff0~0_297, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_106|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_199, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_460, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_78|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:18:56,838 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:18:56,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1297 [2022-12-06 06:18:56,839 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 392 flow [2022-12-06 06:18:56,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-06 06:18:56,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:56,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:56,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:18:56,839 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2008135766, now seen corresponding path program 2 times [2022-12-06 06:18:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:56,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105236767] [2022-12-06 06:18:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:18:56,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:18:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:18:56,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:18:56,988 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:18:56,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:18:56,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:18:56,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:18:56,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:18:56,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:18:56,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:18:56,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:18:56,992 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:56,996 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:18:56,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:18:57,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:18:57 BasicIcfg [2022-12-06 06:18:57,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:18:57,067 INFO L158 Benchmark]: Toolchain (without parser) took 14393.65ms. Allocated memory was 180.4MB in the beginning and 447.7MB in the end (delta: 267.4MB). Free memory was 154.3MB in the beginning and 322.9MB in the end (delta: -168.5MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2022-12-06 06:18:57,067 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:18:57,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.02ms. Allocated memory is still 180.4MB. Free memory was 153.8MB in the beginning and 126.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:18:57,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.21ms. Allocated memory is still 180.4MB. Free memory was 126.5MB in the beginning and 123.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:18:57,068 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 180.4MB. Free memory was 123.9MB in the beginning and 122.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:18:57,068 INFO L158 Benchmark]: RCFGBuilder took 577.97ms. Allocated memory is still 180.4MB. Free memory was 122.4MB in the beginning and 87.2MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:18:57,068 INFO L158 Benchmark]: TraceAbstraction took 13191.71ms. Allocated memory was 180.4MB in the beginning and 447.7MB in the end (delta: 267.4MB). Free memory was 86.7MB in the beginning and 322.9MB in the end (delta: -236.2MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. [2022-12-06 06:18:57,069 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.15ms. Allocated memory is still 180.4MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 521.02ms. Allocated memory is still 180.4MB. Free memory was 153.8MB in the beginning and 126.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.21ms. Allocated memory is still 180.4MB. Free memory was 126.5MB in the beginning and 123.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 180.4MB. Free memory was 123.9MB in the beginning and 122.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 577.97ms. Allocated memory is still 180.4MB. Free memory was 122.4MB in the beginning and 87.2MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13191.71ms. Allocated memory was 180.4MB in the beginning and 447.7MB in the end (delta: 267.4MB). Free memory was 86.7MB in the beginning and 322.9MB in the end (delta: -236.2MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 120 PlacesBefore, 40 PlacesAfterwards, 112 TransitionsBefore, 31 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1656, independent: 1597, independent conditional: 1597, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1656, independent: 1597, independent conditional: 0, independent unconditional: 1597, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1656, independent: 1597, independent conditional: 0, independent unconditional: 1597, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1656, independent: 1597, independent conditional: 0, independent unconditional: 1597, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1285, independent: 1253, independent conditional: 0, independent unconditional: 1253, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1285, independent: 1233, independent conditional: 0, independent unconditional: 1233, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1656, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 1285, unknown conditional: 0, unknown unconditional: 1285] , Statistics on independence cache: Total cache size (in pairs): 2045, Positive cache size: 2013, Positive conditional cache size: 0, Positive unconditional cache size: 2013, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 240, independent conditional: 23, independent unconditional: 217, dependent: 50, dependent conditional: 9, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 290, independent: 240, independent conditional: 23, independent unconditional: 217, dependent: 50, dependent conditional: 9, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 290, independent: 240, independent conditional: 23, independent unconditional: 217, dependent: 50, dependent conditional: 9, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 185, independent: 155, independent conditional: 22, independent unconditional: 133, dependent: 30, dependent conditional: 8, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 185, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 30, dependent conditional: 8, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 116, dependent conditional: 35, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, independent: 85, independent conditional: 1, independent unconditional: 84, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 185, unknown conditional: 30, unknown unconditional: 155] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 155, Positive conditional cache size: 22, Positive unconditional cache size: 133, Negative cache size: 30, Negative conditional cache size: 8, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 65, independent conditional: 6, independent unconditional: 59, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 20, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 169, Positive conditional cache size: 22, Positive unconditional cache size: 147, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 6, independent unconditional: 60, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 86, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 172, Positive conditional cache size: 22, Positive unconditional cache size: 150, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 88, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 172, Positive conditional cache size: 22, Positive unconditional cache size: 150, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 281, independent: 235, independent conditional: 235, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 281, independent: 235, independent conditional: 127, independent unconditional: 108, dependent: 46, dependent conditional: 4, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 281, independent: 235, independent conditional: 110, independent unconditional: 125, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 281, independent: 235, independent conditional: 110, independent unconditional: 125, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 24, independent unconditional: 0, 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: 25, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 281, independent: 211, independent conditional: 86, independent unconditional: 125, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 25, unknown conditional: 24, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 206, Positive conditional cache size: 46, Positive unconditional cache size: 160, Negative cache size: 38, Negative conditional cache size: 8, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 166, independent: 110, independent conditional: 50, independent unconditional: 60, dependent: 56, dependent conditional: 4, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, independent: 110, independent conditional: 42, independent unconditional: 68, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 110, independent conditional: 42, independent unconditional: 68, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 166, independent: 106, independent conditional: 38, independent unconditional: 68, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 210, Positive conditional cache size: 50, Positive unconditional cache size: 160, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 50 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 107, independent conditional: 57, independent unconditional: 50, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 107, independent conditional: 45, independent unconditional: 62, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 107, independent conditional: 45, independent unconditional: 62, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 7, independent unconditional: 5, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 130, independent: 95, independent conditional: 38, independent unconditional: 57, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 254, Positive conditional cache size: 64, Positive unconditional cache size: 190, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 54 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 68, independent conditional: 48, independent unconditional: 20, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 68, independent conditional: 36, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 68, independent conditional: 36, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 90, independent: 66, independent conditional: 34, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 262, Positive conditional cache size: 66, Positive unconditional cache size: 196, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 52 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 81, independent conditional: 72, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 81, independent conditional: 54, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 81, independent conditional: 54, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 90, independent: 79, independent conditional: 52, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 271, Positive conditional cache size: 68, Positive unconditional cache size: 203, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 271, Positive conditional cache size: 68, Positive unconditional cache size: 203, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 46 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 125, independent conditional: 119, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 125, independent conditional: 115, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 125, independent conditional: 115, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, independent: 114, independent conditional: 104, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 347, Positive conditional cache size: 100, Positive unconditional cache size: 247, Negative cache size: 39, Negative conditional cache size: 8, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=-1, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=0, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=1, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=255, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=255, x=1, y=1, 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: 853]: 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: 855]: 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: 851]: 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, 145 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: 13.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 992 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 25 mSDtfsCounter, 992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred in iteration=11, InterpolantAutomatonStates: 52, 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.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1079 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-06 06:18:57,122 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...