/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/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:52:39,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:52:39,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:52:39,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:52:39,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:52:39,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:52:39,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:52:39,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:52:39,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:52:39,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:52:39,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:52:39,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:52:39,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:52:39,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:52:39,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:52:39,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:52:39,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:52:39,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:52:39,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:52:39,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:52:39,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:52:39,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:52:39,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:52:39,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:52:39,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:52:39,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:52:39,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:52:39,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:52:39,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:52:39,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:52:39,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:52:39,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:52:39,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:52:39,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:52:39,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:52:39,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:52:39,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:52:39,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:52:39,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:52:39,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:52:39,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:52:39,459 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-13 11:52:39,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:52:39,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:52:39,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:52:39,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:52:39,487 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:52:39,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:52:39,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:52:39,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:52:39,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:52:39,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:52:39,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:52:39,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:52:39,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:52:39,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:39,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:52:39,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:52:39,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:52:39,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:52:39,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:52:39,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:52:39,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:52:39,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:52:39,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:52:39,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:52:39,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:52:39,759 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:52:39,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-13 11:52:40,775 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:52:41,027 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:52:41,027 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-13 11:52:41,053 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1162ff8/0d94b43196204328a152fb789c98f7f7/FLAG5c5b05fd8 [2022-12-13 11:52:41,063 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1162ff8/0d94b43196204328a152fb789c98f7f7 [2022-12-13 11:52:41,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:52:41,069 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:52:41,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:41,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:52:41,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:52:41,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30677fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41, skipping insertion in model container [2022-12-13 11:52:41,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:52:41,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:52:41,220 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/mix038_tso.oepc.i[949,962] [2022-12-13 11:52:41,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:41,399 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:52:41,409 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/mix038_tso.oepc.i[949,962] [2022-12-13 11:52:41,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:41,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:41,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:41,500 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:52:41,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41 WrapperNode [2022-12-13 11:52:41,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:41,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:41,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:52:41,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:52:41,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,561 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 11:52:41,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:41,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:52:41,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:52:41,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:52:41,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,590 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:52:41,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:52:41,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:52:41,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:52:41,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (1/1) ... [2022-12-13 11:52:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:41,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:52:41,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:52:41,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:52:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:52:41,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:52:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:52:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:52:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:52:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:52:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:52:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:52:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:52:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:52:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:52:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:52:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:52:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:52:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:52:41,732 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:52:41,821 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:52:41,823 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:52:42,065 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:52:42,193 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:52:42,193 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:52:42,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:42 BoogieIcfgContainer [2022-12-13 11:52:42,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:52:42,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:52:42,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:52:42,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:52:42,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:52:41" (1/3) ... [2022-12-13 11:52:42,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9bf0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:42, skipping insertion in model container [2022-12-13 11:52:42,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:41" (2/3) ... [2022-12-13 11:52:42,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9bf0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:42, skipping insertion in model container [2022-12-13 11:52:42,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:42" (3/3) ... [2022-12-13 11:52:42,201 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-12-13 11:52:42,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:52:42,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:52:42,214 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:52:42,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:52:42,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 11:52:42,338 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 11:52:42,338 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:42,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 11:52:42,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 11:52:42,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:42,349 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:42,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:42,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:42,412 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 11:52:42,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:42,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 11:52:42,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 11:52:42,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-13 11:52:47,415 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-13 11:52:47,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:52:47,429 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;@4d16c6ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:52:47,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:52:47,432 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 11:52:47,432 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:47,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:47,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:52:47,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 478430068, now seen corresponding path program 1 times [2022-12-13 11:52:47,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:47,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153231666] [2022-12-13 11:52:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:47,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153231666] [2022-12-13 11:52:47,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153231666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:47,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:47,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004810680] [2022-12-13 11:52:47,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:47,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:47,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-13 11:52:47,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:47,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:47,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-13 11:52:47,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:49,120 INFO L130 PetriNetUnfolder]: 10824/17312 cut-off events. [2022-12-13 11:52:49,120 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 11:52:49,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32739 conditions, 17312 events. 10824/17312 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 132186 event pairs, 1448 based on Foata normal form. 0/10609 useless extension candidates. Maximal degree in co-relation 32728. Up to 12997 conditions per place. [2022-12-13 11:52:49,158 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 36 selfloop transitions, 2 changer transitions 51/100 dead transitions. [2022-12-13 11:52:49,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 388 flow [2022-12-13 11:52:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-12-13 11:52:49,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2022-12-13 11:52:49,167 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 137 flow. Second operand 3 states and 131 transitions. [2022-12-13 11:52:49,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 388 flow [2022-12-13 11:52:49,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:49,171 INFO L231 Difference]: Finished difference. Result has 69 places, 34 transitions, 78 flow [2022-12-13 11:52:49,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=69, PETRI_TRANSITIONS=34} [2022-12-13 11:52:49,174 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2022-12-13 11:52:49,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:49,175 INFO L89 Accepts]: Start accepts. Operand has 69 places, 34 transitions, 78 flow [2022-12-13 11:52:49,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:49,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:49,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 34 transitions, 78 flow [2022-12-13 11:52:49,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2022-12-13 11:52:49,181 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 11:52:49,181 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:49,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 91 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:52:49,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2022-12-13 11:52:49,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-13 11:52:49,282 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:49,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 11:52:49,283 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 11:52:49,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:49,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:49,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:49,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:52:49,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -211075259, now seen corresponding path program 1 times [2022-12-13 11:52:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636729080] [2022-12-13 11:52:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636729080] [2022-12-13 11:52:49,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636729080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:49,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:49,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411719524] [2022-12-13 11:52:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:49,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:49,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:49,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:49,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2022-12-13 11:52:49,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:49,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:49,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2022-12-13 11:52:49,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:49,732 INFO L130 PetriNetUnfolder]: 1269/2071 cut-off events. [2022-12-13 11:52:49,733 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 11:52:49,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4137 conditions, 2071 events. 1269/2071 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11055 event pairs, 429 based on Foata normal form. 50/1700 useless extension candidates. Maximal degree in co-relation 4127. Up to 1316 conditions per place. [2022-12-13 11:52:49,740 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 29 selfloop transitions, 2 changer transitions 1/43 dead transitions. [2022-12-13 11:52:49,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 162 flow [2022-12-13 11:52:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 11:52:49,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:52:49,741 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 66 transitions. [2022-12-13 11:52:49,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 162 flow [2022-12-13 11:52:49,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:49,742 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 78 flow [2022-12-13 11:52:49,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 11:52:49,743 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -29 predicate places. [2022-12-13 11:52:49,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:49,743 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 78 flow [2022-12-13 11:52:49,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:49,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:49,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 78 flow [2022-12-13 11:52:49,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 78 flow [2022-12-13 11:52:49,747 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 11:52:49,747 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 82 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:52:49,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 78 flow [2022-12-13 11:52:49,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 11:52:49,757 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:49,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 11:52:49,758 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 78 flow [2022-12-13 11:52:49,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:49,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:49,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:49,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:52:49,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2046602764, now seen corresponding path program 1 times [2022-12-13 11:52:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:49,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613033066] [2022-12-13 11:52:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:50,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613033066] [2022-12-13 11:52:50,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613033066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:50,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:50,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003608461] [2022-12-13 11:52:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:50,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:50,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 11:52:50,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:50,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:50,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 11:52:50,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:50,220 INFO L130 PetriNetUnfolder]: 1318/2193 cut-off events. [2022-12-13 11:52:50,220 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-13 11:52:50,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4517 conditions, 2193 events. 1318/2193 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12253 event pairs, 386 based on Foata normal form. 8/1846 useless extension candidates. Maximal degree in co-relation 4506. Up to 1881 conditions per place. [2022-12-13 11:52:50,228 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 32 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 11:52:50,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 181 flow [2022-12-13 11:52:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 11:52:50,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 11:52:50,229 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 78 flow. Second operand 3 states and 66 transitions. [2022-12-13 11:52:50,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 181 flow [2022-12-13 11:52:50,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:50,230 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 93 flow [2022-12-13 11:52:50,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-13 11:52:50,231 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -29 predicate places. [2022-12-13 11:52:50,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:50,231 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 93 flow [2022-12-13 11:52:50,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:50,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:50,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 93 flow [2022-12-13 11:52:50,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 93 flow [2022-12-13 11:52:50,235 INFO L130 PetriNetUnfolder]: 3/48 cut-off events. [2022-12-13 11:52:50,235 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:52:50,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 48 events. 3/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 148 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 65. Up to 10 conditions per place. [2022-12-13 11:52:50,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 93 flow [2022-12-13 11:52:50,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-13 11:52:50,300 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:50,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 11:52:50,301 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 93 flow [2022-12-13 11:52:50,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:50,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:50,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:50,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:52:50,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash -976537361, now seen corresponding path program 1 times [2022-12-13 11:52:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:50,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276013936] [2022-12-13 11:52:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:50,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276013936] [2022-12-13 11:52:50,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276013936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:50,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:50,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207304351] [2022-12-13 11:52:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:50,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:50,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 11:52:50,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:50,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:50,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 11:52:50,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:50,991 INFO L130 PetriNetUnfolder]: 1354/2251 cut-off events. [2022-12-13 11:52:50,992 INFO L131 PetriNetUnfolder]: For 458/458 co-relation queries the response was YES. [2022-12-13 11:52:50,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4928 conditions, 2251 events. 1354/2251 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12558 event pairs, 382 based on Foata normal form. 8/1900 useless extension candidates. Maximal degree in co-relation 4916. Up to 1840 conditions per place. [2022-12-13 11:52:51,006 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 40 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2022-12-13 11:52:51,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 239 flow [2022-12-13 11:52:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 11:52:51,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 11:52:51,011 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 93 flow. Second operand 4 states and 87 transitions. [2022-12-13 11:52:51,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 239 flow [2022-12-13 11:52:51,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:51,016 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 122 flow [2022-12-13 11:52:51,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-13 11:52:51,018 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -26 predicate places. [2022-12-13 11:52:51,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:51,018 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 122 flow [2022-12-13 11:52:51,020 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:51,020 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:51,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 122 flow [2022-12-13 11:52:51,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 122 flow [2022-12-13 11:52:51,030 INFO L130 PetriNetUnfolder]: 20/93 cut-off events. [2022-12-13 11:52:51,031 INFO L131 PetriNetUnfolder]: For 38/43 co-relation queries the response was YES. [2022-12-13 11:52:51,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 93 events. 20/93 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 395 event pairs, 9 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 172. Up to 35 conditions per place. [2022-12-13 11:52:51,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 122 flow [2022-12-13 11:52:51,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-13 11:52:51,070 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:51,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 11:52:51,078 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 122 flow [2022-12-13 11:52:51,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:51,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:51,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:51,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:52:51,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1908027608, now seen corresponding path program 1 times [2022-12-13 11:52:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:51,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139557257] [2022-12-13 11:52:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:51,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139557257] [2022-12-13 11:52:51,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139557257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:51,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:51,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:51,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712439873] [2022-12-13 11:52:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:51,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 11:52:51,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:51,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:51,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 11:52:51,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:51,515 INFO L130 PetriNetUnfolder]: 1379/2312 cut-off events. [2022-12-13 11:52:51,515 INFO L131 PetriNetUnfolder]: For 1169/1181 co-relation queries the response was YES. [2022-12-13 11:52:51,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 2312 events. 1379/2312 cut-off events. For 1169/1181 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12935 event pairs, 170 based on Foata normal form. 14/1961 useless extension candidates. Maximal degree in co-relation 5543. Up to 1724 conditions per place. [2022-12-13 11:52:51,524 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-13 11:52:51,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 296 flow [2022-12-13 11:52:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 11:52:51,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2022-12-13 11:52:51,526 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 122 flow. Second operand 4 states and 89 transitions. [2022-12-13 11:52:51,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 296 flow [2022-12-13 11:52:51,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 286 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:51,528 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 153 flow [2022-12-13 11:52:51,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-13 11:52:51,528 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -24 predicate places. [2022-12-13 11:52:51,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:51,528 INFO L89 Accepts]: Start accepts. Operand has 48 places, 41 transitions, 153 flow [2022-12-13 11:52:51,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:51,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:51,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 153 flow [2022-12-13 11:52:51,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 153 flow [2022-12-13 11:52:51,542 INFO L130 PetriNetUnfolder]: 55/184 cut-off events. [2022-12-13 11:52:51,543 INFO L131 PetriNetUnfolder]: For 128/136 co-relation queries the response was YES. [2022-12-13 11:52:51,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 184 events. 55/184 cut-off events. For 128/136 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 941 event pairs, 26 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 405. Up to 65 conditions per place. [2022-12-13 11:52:51,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 41 transitions, 153 flow [2022-12-13 11:52:51,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 11:52:51,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L748-->L751: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:51,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L748-->L751: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [435] $Ultimate##0-->L777: Formula: (and (= v_~x$r_buff0_thd2~0_74 1) (= v_~x$r_buff0_thd0~0_113 v_~x$r_buff1_thd0~0_110) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_57 v_~x$r_buff0_thd2~0_75) (= v_~x$w_buff0~0_140 v_~x$w_buff1~0_125) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_234 v_~x$w_buff1_used~0_197) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_197 256) 0)) (not (= (mod v_~x$w_buff0_used~0_233 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|) (= 2 v_~x$w_buff0~0_139) (= v_~x$w_buff0_used~0_233 1) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd3~0_49 v_~x$r_buff0_thd3~0_43)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_140, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_113, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_234, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_139, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_113, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_197, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_74, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_110, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_233, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-13 11:52:51,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L748-->L751: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [367] L2-1-->L846: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_173 256) 0))) (.cse2 (not (= 0 (mod v_~x$r_buff1_thd0~0_78 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_78 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_174 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_141 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_173 (ite .cse0 0 v_~x$w_buff0_used~0_174)) (= v_~x$r_buff1_thd0~0_77 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_77 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_140 256) 0)) .cse2)) 0 v_~x$r_buff1_thd0~0_78)) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_78) v_~x$r_buff0_thd0~0_77) (= (ite .cse0 v_~x$w_buff0~0_93 (ite .cse4 v_~x$w_buff1~0_80 v_~x~0_108)) v_~x~0_107) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:51,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:51,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-13 11:52:51,885 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 162 flow [2022-12-13 11:52:51,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:51,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:51,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:51,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:52:51,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1462477902, now seen corresponding path program 1 times [2022-12-13 11:52:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:51,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228447873] [2022-12-13 11:52:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:52,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228447873] [2022-12-13 11:52:52,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228447873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:52,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:52,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489431178] [2022-12-13 11:52:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:52,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:52,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:52,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:52,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:52,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 11:52:52,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:52,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:52,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 11:52:52,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:52,327 INFO L130 PetriNetUnfolder]: 1321/2198 cut-off events. [2022-12-13 11:52:52,327 INFO L131 PetriNetUnfolder]: For 2212/2262 co-relation queries the response was YES. [2022-12-13 11:52:52,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5847 conditions, 2198 events. 1321/2198 cut-off events. For 2212/2262 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12231 event pairs, 187 based on Foata normal form. 24/1867 useless extension candidates. Maximal degree in co-relation 5832. Up to 1708 conditions per place. [2022-12-13 11:52:52,338 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 38 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2022-12-13 11:52:52,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 281 flow [2022-12-13 11:52:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 11:52:52,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 11:52:52,339 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 162 flow. Second operand 3 states and 69 transitions. [2022-12-13 11:52:52,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 281 flow [2022-12-13 11:52:52,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 271 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:52,343 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 166 flow [2022-12-13 11:52:52,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-13 11:52:52,345 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2022-12-13 11:52:52,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:52,345 INFO L89 Accepts]: Start accepts. Operand has 49 places, 40 transitions, 166 flow [2022-12-13 11:52:52,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:52,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:52,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 166 flow [2022-12-13 11:52:52,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 166 flow [2022-12-13 11:52:52,360 INFO L130 PetriNetUnfolder]: 53/173 cut-off events. [2022-12-13 11:52:52,360 INFO L131 PetriNetUnfolder]: For 223/242 co-relation queries the response was YES. [2022-12-13 11:52:52,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 173 events. 53/173 cut-off events. For 223/242 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 861 event pairs, 25 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 407. Up to 66 conditions per place. [2022-12-13 11:52:52,361 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 166 flow [2022-12-13 11:52:52,361 INFO L226 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-13 11:52:52,366 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:52,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 11:52:52,367 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 166 flow [2022-12-13 11:52:52,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:52,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:52,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:52,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:52:52,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1908022958, now seen corresponding path program 1 times [2022-12-13 11:52:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087375697] [2022-12-13 11:52:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:52,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:52,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087375697] [2022-12-13 11:52:52,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087375697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:52,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:52,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756862145] [2022-12-13 11:52:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:52,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:52,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:52,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 11:52:52,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:52,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:52,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 11:52:52,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:53,017 INFO L130 PetriNetUnfolder]: 1362/2253 cut-off events. [2022-12-13 11:52:53,018 INFO L131 PetriNetUnfolder]: For 2855/2899 co-relation queries the response was YES. [2022-12-13 11:52:53,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6192 conditions, 2253 events. 1362/2253 cut-off events. For 2855/2899 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12416 event pairs, 213 based on Foata normal form. 18/1913 useless extension candidates. Maximal degree in co-relation 6175. Up to 1733 conditions per place. [2022-12-13 11:52:53,037 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 44 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-13 11:52:53,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 338 flow [2022-12-13 11:52:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 11:52:53,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2022-12-13 11:52:53,044 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 166 flow. Second operand 4 states and 89 transitions. [2022-12-13 11:52:53,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 338 flow [2022-12-13 11:52:53,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 326 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:53,058 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 203 flow [2022-12-13 11:52:53,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-13 11:52:53,059 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -22 predicate places. [2022-12-13 11:52:53,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:53,059 INFO L89 Accepts]: Start accepts. Operand has 50 places, 44 transitions, 203 flow [2022-12-13 11:52:53,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:53,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:53,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 203 flow [2022-12-13 11:52:53,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 203 flow [2022-12-13 11:52:53,074 INFO L130 PetriNetUnfolder]: 72/194 cut-off events. [2022-12-13 11:52:53,075 INFO L131 PetriNetUnfolder]: For 249/294 co-relation queries the response was YES. [2022-12-13 11:52:53,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 194 events. 72/194 cut-off events. For 249/294 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 959 event pairs, 24 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 546. Up to 89 conditions per place. [2022-12-13 11:52:53,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 203 flow [2022-12-13 11:52:53,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 11:52:53,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L748-->L777: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg#1.base_45| |v_P1Thread1of1ForFork2_~arg#1.base_45|) (= v_~x$r_buff0_thd0~0_443 v_~x$r_buff1_thd0~0_444) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_769 256) 0)) (not (= (mod v_~x$w_buff1_used~0_711 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|) (= v_~x~0_697 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_45| |v_P1Thread1of1ForFork2_~arg#1.offset_45|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|) (= v_~x$r_buff0_thd2~0_201 v_~x$r_buff1_thd2~0_157) (= v_~x$r_buff0_thd2~0_200 1) (= v_~x$r_buff0_thd1~0_145 v_~x$r_buff1_thd1~0_151) (= v_~x$w_buff0_used~0_770 v_~x$w_buff1_used~0_711) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49| 0)) (= v_~x$w_buff0_used~0_769 1) (= 2 v_~x$w_buff0~0_539) (= v_~x$r_buff0_thd3~0_163 v_~x$r_buff1_thd3~0_169) (= v_~x$w_buff0~0_540 v_~x$w_buff1~0_505)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_540, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_443, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_145, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_163, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_201, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_770, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_45|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_539, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_45|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_443, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_145, ~x$w_buff1~0=v_~x$w_buff1~0_505, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_169, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_711, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_151, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_163, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_200, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_444, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_769, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_45|, ~x~0=v_~x~0_697, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_45|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset, ~x~0] and [334] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_89 256) 0))))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= v_~x$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse2 v_~x$w_buff1~0_32 v_~x~0_60))) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_88 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:53,263 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:53,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 11:52:53,263 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 209 flow [2022-12-13 11:52:53,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:53,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:53,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:53,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:52:53,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1907915078, now seen corresponding path program 2 times [2022-12-13 11:52:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:53,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929480397] [2022-12-13 11:52:53,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:53,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:53,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:53,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929480397] [2022-12-13 11:52:53,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929480397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:53,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:53,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:53,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774524658] [2022-12-13 11:52:53,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:53,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:53,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 11:52:53,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:53,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:53,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 11:52:53,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:53,793 INFO L130 PetriNetUnfolder]: 1511/2478 cut-off events. [2022-12-13 11:52:53,793 INFO L131 PetriNetUnfolder]: For 4418/4521 co-relation queries the response was YES. [2022-12-13 11:52:53,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 2478 events. 1511/2478 cut-off events. For 4418/4521 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14086 event pairs, 346 based on Foata normal form. 46/2117 useless extension candidates. Maximal degree in co-relation 7566. Up to 1644 conditions per place. [2022-12-13 11:52:53,804 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 51 selfloop transitions, 18 changer transitions 0/79 dead transitions. [2022-12-13 11:52:53,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 476 flow [2022-12-13 11:52:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:52:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:52:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-13 11:52:53,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-13 11:52:53,806 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 209 flow. Second operand 5 states and 115 transitions. [2022-12-13 11:52:53,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 476 flow [2022-12-13 11:52:53,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 456 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:53,810 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 306 flow [2022-12-13 11:52:53,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-13 11:52:53,811 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2022-12-13 11:52:53,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:53,811 INFO L89 Accepts]: Start accepts. Operand has 54 places, 51 transitions, 306 flow [2022-12-13 11:52:53,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:53,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:53,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 306 flow [2022-12-13 11:52:53,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 306 flow [2022-12-13 11:52:53,829 INFO L130 PetriNetUnfolder]: 82/227 cut-off events. [2022-12-13 11:52:53,829 INFO L131 PetriNetUnfolder]: For 600/771 co-relation queries the response was YES. [2022-12-13 11:52:53,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 227 events. 82/227 cut-off events. For 600/771 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1205 event pairs, 24 based on Foata normal form. 6/176 useless extension candidates. Maximal degree in co-relation 788. Up to 104 conditions per place. [2022-12-13 11:52:53,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 51 transitions, 306 flow [2022-12-13 11:52:53,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 11:52:53,838 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:53,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 11:52:53,839 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 306 flow [2022-12-13 11:52:53,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:53,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:53,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:53,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:52:53,840 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1908022865, now seen corresponding path program 1 times [2022-12-13 11:52:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:53,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159198180] [2022-12-13 11:52:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:54,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159198180] [2022-12-13 11:52:54,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159198180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:54,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:54,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:54,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45147494] [2022-12-13 11:52:54,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:54,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:54,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 11:52:54,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:54,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:54,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 11:52:54,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:54,389 INFO L130 PetriNetUnfolder]: 1617/2690 cut-off events. [2022-12-13 11:52:54,390 INFO L131 PetriNetUnfolder]: For 8412/8565 co-relation queries the response was YES. [2022-12-13 11:52:54,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9417 conditions, 2690 events. 1617/2690 cut-off events. For 8412/8565 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15762 event pairs, 179 based on Foata normal form. 58/2332 useless extension candidates. Maximal degree in co-relation 9398. Up to 2010 conditions per place. [2022-12-13 11:52:54,406 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 53 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2022-12-13 11:52:54,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 532 flow [2022-12-13 11:52:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 11:52:54,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6148648648648649 [2022-12-13 11:52:54,408 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 306 flow. Second operand 4 states and 91 transitions. [2022-12-13 11:52:54,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 532 flow [2022-12-13 11:52:54,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 517 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:54,415 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 357 flow [2022-12-13 11:52:54,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2022-12-13 11:52:54,416 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2022-12-13 11:52:54,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:54,416 INFO L89 Accepts]: Start accepts. Operand has 57 places, 54 transitions, 357 flow [2022-12-13 11:52:54,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:54,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:54,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 54 transitions, 357 flow [2022-12-13 11:52:54,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 357 flow [2022-12-13 11:52:54,441 INFO L130 PetriNetUnfolder]: 86/245 cut-off events. [2022-12-13 11:52:54,441 INFO L131 PetriNetUnfolder]: For 744/974 co-relation queries the response was YES. [2022-12-13 11:52:54,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 245 events. 86/245 cut-off events. For 744/974 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1339 event pairs, 20 based on Foata normal form. 6/189 useless extension candidates. Maximal degree in co-relation 919. Up to 112 conditions per place. [2022-12-13 11:52:54,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 54 transitions, 357 flow [2022-12-13 11:52:54,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 932 [2022-12-13 11:52:54,447 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:54,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 11:52:54,448 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 357 flow [2022-12-13 11:52:54,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:54,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:54,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:52:54,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1907912195, now seen corresponding path program 2 times [2022-12-13 11:52:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:54,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162106693] [2022-12-13 11:52:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:54,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162106693] [2022-12-13 11:52:54,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162106693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:54,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:54,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721221260] [2022-12-13 11:52:54,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:54,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:54,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:54,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 11:52:54,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:54,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:54,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 11:52:54,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:55,136 INFO L130 PetriNetUnfolder]: 1639/2729 cut-off events. [2022-12-13 11:52:55,137 INFO L131 PetriNetUnfolder]: For 10652/10838 co-relation queries the response was YES. [2022-12-13 11:52:55,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10323 conditions, 2729 events. 1639/2729 cut-off events. For 10652/10838 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16089 event pairs, 191 based on Foata normal form. 50/2355 useless extension candidates. Maximal degree in co-relation 10302. Up to 1705 conditions per place. [2022-12-13 11:52:55,149 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 49 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2022-12-13 11:52:55,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 603 flow [2022-12-13 11:52:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 11:52:55,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2022-12-13 11:52:55,151 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 357 flow. Second operand 4 states and 94 transitions. [2022-12-13 11:52:55,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 603 flow [2022-12-13 11:52:55,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 579 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:55,162 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 419 flow [2022-12-13 11:52:55,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=419, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-13 11:52:55,163 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2022-12-13 11:52:55,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:55,164 INFO L89 Accepts]: Start accepts. Operand has 59 places, 56 transitions, 419 flow [2022-12-13 11:52:55,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:55,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:55,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 419 flow [2022-12-13 11:52:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 56 transitions, 419 flow [2022-12-13 11:52:55,184 INFO L130 PetriNetUnfolder]: 87/251 cut-off events. [2022-12-13 11:52:55,184 INFO L131 PetriNetUnfolder]: For 1125/1515 co-relation queries the response was YES. [2022-12-13 11:52:55,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 251 events. 87/251 cut-off events. For 1125/1515 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1401 event pairs, 21 based on Foata normal form. 8/195 useless extension candidates. Maximal degree in co-relation 1045. Up to 115 conditions per place. [2022-12-13 11:52:55,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 56 transitions, 419 flow [2022-12-13 11:52:55,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 958 [2022-12-13 11:52:55,189 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:55,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 11:52:55,190 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 419 flow [2022-12-13 11:52:55,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:55,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:55,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:55,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:52:55,190 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 984171370, now seen corresponding path program 1 times [2022-12-13 11:52:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:55,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074052592] [2022-12-13 11:52:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:55,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074052592] [2022-12-13 11:52:55,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074052592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:55,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:55,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121486780] [2022-12-13 11:52:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:55,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:52:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:52:55,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:52:55,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 11:52:55,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:55,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:55,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 11:52:55,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:55,810 INFO L130 PetriNetUnfolder]: 1670/2790 cut-off events. [2022-12-13 11:52:55,810 INFO L131 PetriNetUnfolder]: For 14200/14489 co-relation queries the response was YES. [2022-12-13 11:52:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11252 conditions, 2790 events. 1670/2790 cut-off events. For 14200/14489 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16642 event pairs, 191 based on Foata normal form. 86/2443 useless extension candidates. Maximal degree in co-relation 11230. Up to 2032 conditions per place. [2022-12-13 11:52:55,826 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 56 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2022-12-13 11:52:55,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 703 flow [2022-12-13 11:52:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 11:52:55,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-13 11:52:55,828 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 419 flow. Second operand 4 states and 92 transitions. [2022-12-13 11:52:55,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 703 flow [2022-12-13 11:52:55,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:55,834 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 503 flow [2022-12-13 11:52:55,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2022-12-13 11:52:55,834 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2022-12-13 11:52:55,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:55,834 INFO L89 Accepts]: Start accepts. Operand has 61 places, 60 transitions, 503 flow [2022-12-13 11:52:55,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:55,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:55,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 60 transitions, 503 flow [2022-12-13 11:52:55,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 60 transitions, 503 flow [2022-12-13 11:52:55,856 INFO L130 PetriNetUnfolder]: 91/266 cut-off events. [2022-12-13 11:52:55,856 INFO L131 PetriNetUnfolder]: For 1348/1637 co-relation queries the response was YES. [2022-12-13 11:52:55,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 266 events. 91/266 cut-off events. For 1348/1637 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1527 event pairs, 21 based on Foata normal form. 9/207 useless extension candidates. Maximal degree in co-relation 1168. Up to 123 conditions per place. [2022-12-13 11:52:55,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 60 transitions, 503 flow [2022-12-13 11:52:55,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 998 [2022-12-13 11:52:55,861 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:55,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 11:52:55,862 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 503 flow [2022-12-13 11:52:55,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:55,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:55,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:55,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:52:55,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash 984266509, now seen corresponding path program 1 times [2022-12-13 11:52:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:55,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042817384] [2022-12-13 11:52:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:56,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042817384] [2022-12-13 11:52:56,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042817384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:56,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:56,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413992344] [2022-12-13 11:52:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:56,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:52:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:56,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:52:56,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:52:56,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 11:52:56,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 503 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:56,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:56,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 11:52:56,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:56,571 INFO L130 PetriNetUnfolder]: 1706/2857 cut-off events. [2022-12-13 11:52:56,571 INFO L131 PetriNetUnfolder]: For 17290/17542 co-relation queries the response was YES. [2022-12-13 11:52:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12055 conditions, 2857 events. 1706/2857 cut-off events. For 17290/17542 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17190 event pairs, 180 based on Foata normal form. 82/2496 useless extension candidates. Maximal degree in co-relation 12032. Up to 2120 conditions per place. [2022-12-13 11:52:56,587 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 62 selfloop transitions, 19 changer transitions 0/91 dead transitions. [2022-12-13 11:52:56,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 860 flow [2022-12-13 11:52:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:52:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:52:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 11:52:56,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2022-12-13 11:52:56,588 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 503 flow. Second operand 5 states and 108 transitions. [2022-12-13 11:52:56,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 860 flow [2022-12-13 11:52:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 828 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:56,597 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 639 flow [2022-12-13 11:52:56,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=639, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2022-12-13 11:52:56,597 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2022-12-13 11:52:56,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:56,597 INFO L89 Accepts]: Start accepts. Operand has 65 places, 67 transitions, 639 flow [2022-12-13 11:52:56,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:56,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:56,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 67 transitions, 639 flow [2022-12-13 11:52:56,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 67 transitions, 639 flow [2022-12-13 11:52:56,620 INFO L130 PetriNetUnfolder]: 96/283 cut-off events. [2022-12-13 11:52:56,620 INFO L131 PetriNetUnfolder]: For 2000/2424 co-relation queries the response was YES. [2022-12-13 11:52:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 283 events. 96/283 cut-off events. For 2000/2424 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1662 event pairs, 22 based on Foata normal form. 11/222 useless extension candidates. Maximal degree in co-relation 1352. Up to 132 conditions per place. [2022-12-13 11:52:56,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 67 transitions, 639 flow [2022-12-13 11:52:56,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-13 11:52:56,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L748-->L846: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_447 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_446 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_773 256))))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_774 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_714 256) 0)) .cse3))) (and (= v_~x$w_buff1_used~0_713 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_714)) (= v_~x$r_buff0_thd0~0_445 (ite .cse1 0 v_~x$r_buff0_thd0~0_446)) (= (ite .cse2 0 v_~x$w_buff0_used~0_774) v_~x$w_buff0_used~0_773) (= (ite .cse2 v_~x$w_buff0~0_543 (ite .cse0 v_~x$w_buff1~0_507 1)) v_~x~0_699) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_713 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_445 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_447) v_~x$r_buff1_thd0~0_446)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_543, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_446, ~x$w_buff1~0=v_~x$w_buff1~0_507, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_714, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_447, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_774} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_543, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_445, ~x$w_buff1~0=v_~x$w_buff1~0_507, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_713, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_446, ~x~0=v_~x~0_699, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_773} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [435] $Ultimate##0-->L777: Formula: (and (= v_~x$r_buff0_thd2~0_74 1) (= v_~x$r_buff0_thd0~0_113 v_~x$r_buff1_thd0~0_110) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_57 v_~x$r_buff0_thd2~0_75) (= v_~x$w_buff0~0_140 v_~x$w_buff1~0_125) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_234 v_~x$w_buff1_used~0_197) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_197 256) 0)) (not (= (mod v_~x$w_buff0_used~0_233 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|) (= 2 v_~x$w_buff0~0_139) (= v_~x$w_buff0_used~0_233 1) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd3~0_49 v_~x$r_buff0_thd3~0_43)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_140, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_113, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_234, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_139, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_113, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_197, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_74, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_110, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_233, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-13 11:52:56,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L748-->L846: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_447 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_446 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_773 256))))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_774 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_714 256) 0)) .cse3))) (and (= v_~x$w_buff1_used~0_713 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_714)) (= v_~x$r_buff0_thd0~0_445 (ite .cse1 0 v_~x$r_buff0_thd0~0_446)) (= (ite .cse2 0 v_~x$w_buff0_used~0_774) v_~x$w_buff0_used~0_773) (= (ite .cse2 v_~x$w_buff0~0_543 (ite .cse0 v_~x$w_buff1~0_507 1)) v_~x~0_699) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_713 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_445 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_447) v_~x$r_buff1_thd0~0_446)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_543, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_446, ~x$w_buff1~0=v_~x$w_buff1~0_507, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_714, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_447, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_774} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_543, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_445, ~x$w_buff1~0=v_~x$w_buff1~0_507, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_713, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_446, ~x~0=v_~x~0_699, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_773} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [334] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_89 256) 0))))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= v_~x$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse2 v_~x$w_buff1~0_32 v_~x~0_60))) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_88 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:56,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L748-->L846: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_447 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_446 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_773 256))))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_774 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_714 256) 0)) .cse3))) (and (= v_~x$w_buff1_used~0_713 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_714)) (= v_~x$r_buff0_thd0~0_445 (ite .cse1 0 v_~x$r_buff0_thd0~0_446)) (= (ite .cse2 0 v_~x$w_buff0_used~0_774) v_~x$w_buff0_used~0_773) (= (ite .cse2 v_~x$w_buff0~0_543 (ite .cse0 v_~x$w_buff1~0_507 1)) v_~x~0_699) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_713 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_445 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_447) v_~x$r_buff1_thd0~0_446)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_543, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_446, ~x$w_buff1~0=v_~x$w_buff1~0_507, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_714, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_447, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_774} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_543, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_445, ~x$w_buff1~0=v_~x$w_buff1~0_507, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_713, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_446, ~x~0=v_~x~0_699, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_773} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:57,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:57,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 461 [2022-12-13 11:52:57,058 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 647 flow [2022-12-13 11:52:57,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:57,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:57,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:57,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:52:57,058 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2145333486, now seen corresponding path program 1 times [2022-12-13 11:52:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:57,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021649703] [2022-12-13 11:52:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:57,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021649703] [2022-12-13 11:52:57,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021649703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:57,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:57,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:52:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071800397] [2022-12-13 11:52:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:57,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:52:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:52:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:52:57,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2022-12-13 11:52:57,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 647 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:57,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:57,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2022-12-13 11:52:57,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:58,034 INFO L130 PetriNetUnfolder]: 4049/6259 cut-off events. [2022-12-13 11:52:58,034 INFO L131 PetriNetUnfolder]: For 45824/45824 co-relation queries the response was YES. [2022-12-13 11:52:58,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26352 conditions, 6259 events. 4049/6259 cut-off events. For 45824/45824 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 37056 event pairs, 324 based on Foata normal form. 114/5439 useless extension candidates. Maximal degree in co-relation 26327. Up to 3425 conditions per place. [2022-12-13 11:52:58,071 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 115 selfloop transitions, 71 changer transitions 0/194 dead transitions. [2022-12-13 11:52:58,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 194 transitions, 2248 flow [2022-12-13 11:52:58,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:52:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:52:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-12-13 11:52:58,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5677655677655677 [2022-12-13 11:52:58,073 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 647 flow. Second operand 7 states and 155 transitions. [2022-12-13 11:52:58,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 194 transitions, 2248 flow [2022-12-13 11:52:58,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 194 transitions, 2156 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:58,105 INFO L231 Difference]: Finished difference. Result has 72 places, 139 transitions, 1837 flow [2022-12-13 11:52:58,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1837, PETRI_PLACES=72, PETRI_TRANSITIONS=139} [2022-12-13 11:52:58,106 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2022-12-13 11:52:58,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:58,106 INFO L89 Accepts]: Start accepts. Operand has 72 places, 139 transitions, 1837 flow [2022-12-13 11:52:58,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:58,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:58,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 139 transitions, 1837 flow [2022-12-13 11:52:58,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 139 transitions, 1837 flow [2022-12-13 11:52:58,182 INFO L130 PetriNetUnfolder]: 420/940 cut-off events. [2022-12-13 11:52:58,182 INFO L131 PetriNetUnfolder]: For 7194/7354 co-relation queries the response was YES. [2022-12-13 11:52:58,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 940 events. 420/940 cut-off events. For 7194/7354 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6599 event pairs, 24 based on Foata normal form. 52/798 useless extension candidates. Maximal degree in co-relation 4823. Up to 432 conditions per place. [2022-12-13 11:52:58,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 139 transitions, 1837 flow [2022-12-13 11:52:58,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 1528 [2022-12-13 11:52:58,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [367] L2-1-->L846: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_173 256) 0))) (.cse2 (not (= 0 (mod v_~x$r_buff1_thd0~0_78 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_78 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_174 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_141 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_173 (ite .cse0 0 v_~x$w_buff0_used~0_174)) (= v_~x$r_buff1_thd0~0_77 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_77 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_140 256) 0)) .cse2)) 0 v_~x$r_buff1_thd0~0_78)) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_78) v_~x$r_buff0_thd0~0_77) (= (ite .cse0 v_~x$w_buff0~0_93 (ite .cse4 v_~x$w_buff1~0_80 v_~x~0_108)) v_~x~0_107) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [334] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_89 256) 0))))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= v_~x$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse2 v_~x$w_buff1~0_32 v_~x~0_60))) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_88 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [367] L2-1-->L846: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_173 256) 0))) (.cse2 (not (= 0 (mod v_~x$r_buff1_thd0~0_78 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_78 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_174 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_141 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_173 (ite .cse0 0 v_~x$w_buff0_used~0_174)) (= v_~x$r_buff1_thd0~0_77 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_77 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_140 256) 0)) .cse2)) 0 v_~x$r_buff1_thd0~0_78)) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_78) v_~x$r_buff0_thd0~0_77) (= (ite .cse0 v_~x$w_buff0~0_93 (ite .cse4 v_~x$w_buff1~0_80 v_~x~0_108)) v_~x~0_107) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [367] L2-1-->L846: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_173 256) 0))) (.cse2 (not (= 0 (mod v_~x$r_buff1_thd0~0_78 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_78 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_174 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_141 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_173 (ite .cse0 0 v_~x$w_buff0_used~0_174)) (= v_~x$r_buff1_thd0~0_77 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_77 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_140 256) 0)) .cse2)) 0 v_~x$r_buff1_thd0~0_78)) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_78) v_~x$r_buff0_thd0~0_77) (= (ite .cse0 v_~x$w_buff0~0_93 (ite .cse4 v_~x$w_buff1~0_80 v_~x~0_108)) v_~x~0_107) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_80, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [334] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_89 256) 0))))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= v_~x$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse2 v_~x$w_buff1~0_32 v_~x~0_60))) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_88 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:58,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:59,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:52:59,571 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:52:59,572 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1466 [2022-12-13 11:52:59,572 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 135 transitions, 1816 flow [2022-12-13 11:52:59,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:59,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:59,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:59,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:52:59,572 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:52:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 985462706, now seen corresponding path program 1 times [2022-12-13 11:52:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:59,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484580518] [2022-12-13 11:52:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:59,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484580518] [2022-12-13 11:52:59,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484580518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:59,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:59,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405963749] [2022-12-13 11:52:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:59,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:59,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2022-12-13 11:52:59,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 135 transitions, 1816 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:59,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:59,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2022-12-13 11:52:59,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:00,319 INFO L130 PetriNetUnfolder]: 3748/5938 cut-off events. [2022-12-13 11:53:00,319 INFO L131 PetriNetUnfolder]: For 64973/65231 co-relation queries the response was YES. [2022-12-13 11:53:00,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30130 conditions, 5938 events. 3748/5938 cut-off events. For 64973/65231 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 37544 event pairs, 820 based on Foata normal form. 246/4485 useless extension candidates. Maximal degree in co-relation 30101. Up to 5356 conditions per place. [2022-12-13 11:53:00,354 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 135 selfloop transitions, 10 changer transitions 1/157 dead transitions. [2022-12-13 11:53:00,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 157 transitions, 2267 flow [2022-12-13 11:53:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:53:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:53:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-12-13 11:53:00,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6209150326797386 [2022-12-13 11:53:00,355 INFO L175 Difference]: Start difference. First operand has 71 places, 135 transitions, 1816 flow. Second operand 3 states and 95 transitions. [2022-12-13 11:53:00,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 157 transitions, 2267 flow [2022-12-13 11:53:00,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 157 transitions, 2162 flow, removed 45 selfloop flow, removed 2 redundant places. [2022-12-13 11:53:00,381 INFO L231 Difference]: Finished difference. Result has 72 places, 116 transitions, 1345 flow [2022-12-13 11:53:00,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1345, PETRI_PLACES=72, PETRI_TRANSITIONS=116} [2022-12-13 11:53:00,382 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2022-12-13 11:53:00,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:00,382 INFO L89 Accepts]: Start accepts. Operand has 72 places, 116 transitions, 1345 flow [2022-12-13 11:53:00,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:00,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:00,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 116 transitions, 1345 flow [2022-12-13 11:53:00,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 116 transitions, 1345 flow [2022-12-13 11:53:00,594 INFO L130 PetriNetUnfolder]: 1562/3017 cut-off events. [2022-12-13 11:53:00,595 INFO L131 PetriNetUnfolder]: For 15492/15738 co-relation queries the response was YES. [2022-12-13 11:53:00,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12726 conditions, 3017 events. 1562/3017 cut-off events. For 15492/15738 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 24527 event pairs, 475 based on Foata normal form. 33/1970 useless extension candidates. Maximal degree in co-relation 12699. Up to 1666 conditions per place. [2022-12-13 11:53:00,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 116 transitions, 1345 flow [2022-12-13 11:53:00,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 1418 [2022-12-13 11:53:01,135 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L835-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_Out_2|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [487] L748-->L777: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff0_thd0~0_456 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_799 256) 0)) .cse1))) (let ((.cse0 (ite .cse2 0 v_~x$w_buff0_used~0_799))) (and (= |v_P1Thread1of1ForFork2_#in~arg#1.base_49| |v_P1Thread1of1ForFork2_~arg#1.base_49|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_797 256) 0)) (not (= (mod v_~x$w_buff1_used~0_735 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53|) (= 2 v_~x$w_buff0~0_557) (= .cse0 v_~x$w_buff1_used~0_735) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|) (= v_~x$r_buff0_thd0~0_455 (ite (and .cse1 (not (= (mod .cse0 256) 0))) 0 v_~x$r_buff0_thd0~0_456)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_49| |v_P1Thread1of1ForFork2_~arg#1.offset_49|) (= (ite .cse2 v_~x$w_buff0~0_558 (ite (and (not (= (mod v_~x$w_buff1_used~0_737 256) 0)) (not (= (mod v_~x$r_buff1_thd0~0_458 256) 0))) v_~x$w_buff1~0_520 1)) v_~x~0_721) (= v_~x$w_buff0_used~0_797 1) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53| 0)) (= v_~x$r_buff0_thd2~0_213 v_~x$r_buff1_thd2~0_165) (= v_~x$w_buff0~0_558 v_~x$w_buff1~0_519) (= v_~x$r_buff0_thd0~0_455 v_~x$r_buff1_thd0~0_456) (= v_~x$r_buff0_thd1~0_159 v_~x$r_buff1_thd1~0_165) (= v_~x$r_buff0_thd3~0_167 v_~x$r_buff1_thd3~0_173) (= v_~x$r_buff0_thd2~0_212 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_558, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_456, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, ~x$w_buff1~0=v_~x$w_buff1~0_520, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_737, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_167, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_49|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_458, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_799, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_49|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_557, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_49|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_455, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, ~x$w_buff1~0=v_~x$w_buff1~0_519, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_173, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_165, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_735, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_167, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_456, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_49|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_797, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_49|, ~x~0=v_~x~0_721, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_49|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$r_buff0_thd0~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset, ~x~0] [2022-12-13 11:53:01,491 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:53:01,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1110 [2022-12-13 11:53:01,492 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 115 transitions, 1338 flow [2022-12-13 11:53:01,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:01,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:01,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:01,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:53:01,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1095421793, now seen corresponding path program 1 times [2022-12-13 11:53:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:01,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766872792] [2022-12-13 11:53:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:01,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766872792] [2022-12-13 11:53:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766872792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:01,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800336089] [2022-12-13 11:53:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:01,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:01,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2022-12-13 11:53:01,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 115 transitions, 1338 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:01,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:01,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2022-12-13 11:53:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:02,263 INFO L130 PetriNetUnfolder]: 4412/7400 cut-off events. [2022-12-13 11:53:02,264 INFO L131 PetriNetUnfolder]: For 66984/67292 co-relation queries the response was YES. [2022-12-13 11:53:02,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36801 conditions, 7400 events. 4412/7400 cut-off events. For 66984/67292 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 52566 event pairs, 696 based on Foata normal form. 304/6420 useless extension candidates. Maximal degree in co-relation 36771. Up to 3807 conditions per place. [2022-12-13 11:53:02,296 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 93 selfloop transitions, 5 changer transitions 53/166 dead transitions. [2022-12-13 11:53:02,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 166 transitions, 2135 flow [2022-12-13 11:53:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-13 11:53:02,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2022-12-13 11:53:02,297 INFO L175 Difference]: Start difference. First operand has 72 places, 115 transitions, 1338 flow. Second operand 4 states and 106 transitions. [2022-12-13 11:53:02,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 166 transitions, 2135 flow [2022-12-13 11:53:02,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 166 transitions, 2115 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:02,319 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 847 flow [2022-12-13 11:53:02,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=847, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2022-12-13 11:53:02,319 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2022-12-13 11:53:02,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:02,319 INFO L89 Accepts]: Start accepts. Operand has 75 places, 84 transitions, 847 flow [2022-12-13 11:53:02,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:02,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:02,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 84 transitions, 847 flow [2022-12-13 11:53:02,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 847 flow [2022-12-13 11:53:02,500 INFO L130 PetriNetUnfolder]: 1410/2919 cut-off events. [2022-12-13 11:53:02,500 INFO L131 PetriNetUnfolder]: For 16132/16428 co-relation queries the response was YES. [2022-12-13 11:53:02,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11785 conditions, 2919 events. 1410/2919 cut-off events. For 16132/16428 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 24590 event pairs, 460 based on Foata normal form. 20/1814 useless extension candidates. Maximal degree in co-relation 11757. Up to 1744 conditions per place. [2022-12-13 11:53:02,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 84 transitions, 847 flow [2022-12-13 11:53:02,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 1106 [2022-12-13 11:53:02,532 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:02,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 11:53:02,533 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 847 flow [2022-12-13 11:53:02,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:02,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:02,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:02,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:53:02,533 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:02,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 820608263, now seen corresponding path program 1 times [2022-12-13 11:53:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:02,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616261898] [2022-12-13 11:53:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:02,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616261898] [2022-12-13 11:53:02,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616261898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:02,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:02,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965719405] [2022-12-13 11:53:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:02,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:02,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 11:53:02,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 847 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:02,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:02,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 11:53:02,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:03,000 INFO L130 PetriNetUnfolder]: 1706/3219 cut-off events. [2022-12-13 11:53:03,000 INFO L131 PetriNetUnfolder]: For 31971/32076 co-relation queries the response was YES. [2022-12-13 11:53:03,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17223 conditions, 3219 events. 1706/3219 cut-off events. For 31971/32076 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 22280 event pairs, 205 based on Foata normal form. 321/2550 useless extension candidates. Maximal degree in co-relation 17192. Up to 2116 conditions per place. [2022-12-13 11:53:03,014 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 82 selfloop transitions, 19 changer transitions 14/126 dead transitions. [2022-12-13 11:53:03,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 1531 flow [2022-12-13 11:53:03,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-13 11:53:03,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2022-12-13 11:53:03,016 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 847 flow. Second operand 4 states and 104 transitions. [2022-12-13 11:53:03,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 1531 flow [2022-12-13 11:53:03,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 1354 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-12-13 11:53:03,033 INFO L231 Difference]: Finished difference. Result has 73 places, 86 transitions, 761 flow [2022-12-13 11:53:03,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=761, PETRI_PLACES=73, PETRI_TRANSITIONS=86} [2022-12-13 11:53:03,034 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2022-12-13 11:53:03,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:03,034 INFO L89 Accepts]: Start accepts. Operand has 73 places, 86 transitions, 761 flow [2022-12-13 11:53:03,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:03,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:03,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 86 transitions, 761 flow [2022-12-13 11:53:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 86 transitions, 761 flow [2022-12-13 11:53:03,143 INFO L130 PetriNetUnfolder]: 670/1660 cut-off events. [2022-12-13 11:53:03,143 INFO L131 PetriNetUnfolder]: For 6823/7132 co-relation queries the response was YES. [2022-12-13 11:53:03,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7642 conditions, 1660 events. 670/1660 cut-off events. For 6823/7132 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 13821 event pairs, 112 based on Foata normal form. 25/1078 useless extension candidates. Maximal degree in co-relation 7614. Up to 1021 conditions per place. [2022-12-13 11:53:03,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 86 transitions, 761 flow [2022-12-13 11:53:03,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 1008 [2022-12-13 11:53:03,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:53:03,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-13 11:53:03,283 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 86 transitions, 765 flow [2022-12-13 11:53:03,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:03,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:03,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:03,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:53:03,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:03,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1904219984, now seen corresponding path program 1 times [2022-12-13 11:53:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:03,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101287262] [2022-12-13 11:53:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:03,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:03,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101287262] [2022-12-13 11:53:03,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101287262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:03,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:03,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:53:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503864347] [2022-12-13 11:53:03,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:03,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:53:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:53:03,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:53:03,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2022-12-13 11:53:03,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 86 transitions, 765 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:03,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:03,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2022-12-13 11:53:03,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:03,613 INFO L130 PetriNetUnfolder]: 1005/1927 cut-off events. [2022-12-13 11:53:03,613 INFO L131 PetriNetUnfolder]: For 11087/11163 co-relation queries the response was YES. [2022-12-13 11:53:03,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10335 conditions, 1927 events. 1005/1927 cut-off events. For 11087/11163 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12081 event pairs, 64 based on Foata normal form. 282/1527 useless extension candidates. Maximal degree in co-relation 10304. Up to 964 conditions per place. [2022-12-13 11:53:03,621 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 51 selfloop transitions, 28 changer transitions 31/119 dead transitions. [2022-12-13 11:53:03,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 119 transitions, 1323 flow [2022-12-13 11:53:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:53:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:53:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-13 11:53:03,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2022-12-13 11:53:03,622 INFO L175 Difference]: Start difference. First operand has 73 places, 86 transitions, 765 flow. Second operand 5 states and 113 transitions. [2022-12-13 11:53:03,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 119 transitions, 1323 flow [2022-12-13 11:53:03,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 1213 flow, removed 35 selfloop flow, removed 4 redundant places. [2022-12-13 11:53:03,632 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 525 flow [2022-12-13 11:53:03,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=525, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2022-12-13 11:53:03,632 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2022-12-13 11:53:03,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:03,633 INFO L89 Accepts]: Start accepts. Operand has 74 places, 67 transitions, 525 flow [2022-12-13 11:53:03,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:03,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:03,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 67 transitions, 525 flow [2022-12-13 11:53:03,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 67 transitions, 525 flow [2022-12-13 11:53:03,659 INFO L130 PetriNetUnfolder]: 166/474 cut-off events. [2022-12-13 11:53:03,659 INFO L131 PetriNetUnfolder]: For 574/655 co-relation queries the response was YES. [2022-12-13 11:53:03,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 474 events. 166/474 cut-off events. For 574/655 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2871 event pairs, 4 based on Foata normal form. 7/252 useless extension candidates. Maximal degree in co-relation 1708. Up to 271 conditions per place. [2022-12-13 11:53:03,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 67 transitions, 525 flow [2022-12-13 11:53:03,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 11:53:03,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L748-->L758: Formula: (let ((.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_791 256)))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_156 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_793 256) 0))) (let ((.cse1 (and .cse0 (not .cse4))) (.cse2 (and .cse0 .cse3))) (and (= |v_P1Thread1of1ForFork2_#in~arg#1.base_47| |v_P1Thread1of1ForFork2_~arg#1.base_47|) (= v_~x$r_buff0_thd0~0_453 v_~x$r_buff1_thd0~0_454) (= v_~x$w_buff0_used~0_791 (ite .cse0 0 1)) (= v_~x$r_buff0_thd2~0_208 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_51| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_51|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_51| 0)) (= v_~x$w_buff1_used~0_731 (ite (or .cse1 .cse2) 0 v_~x$w_buff0_used~0_793)) (= v_~x$r_buff0_thd2~0_209 v_~x$r_buff1_thd2~0_163) (= v_~x$r_buff0_thd3~0_165 v_~x$r_buff1_thd3~0_171) (= v_~x$r_buff1_thd1~0_161 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_731 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_155 256) 0)))) 0 v_~x$r_buff0_thd1~0_156)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_51| (ite .cse4 1 0)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_47| |v_P1Thread1of1ForFork2_~arg#1.offset_47|) (= (ite .cse0 v_~x$w_buff0~0_553 (ite .cse1 v_~x$w_buff1~0_517 1)) v_~x~0_717) (= v_~x$w_buff0~0_554 v_~x$w_buff1~0_517) (= 2 v_~x$w_buff0~0_553) (= v_~x$r_buff0_thd1~0_155 (ite .cse2 0 v_~x$r_buff0_thd1~0_156))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_554, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_453, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_165, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_209, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_47|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_793, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_47|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_553, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_47|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_453, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_155, ~x$w_buff1~0=v_~x$w_buff1~0_517, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_731, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_171, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_163, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_161, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_165, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_208, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_454, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_47|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_791, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_51|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_51|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_47|, ~x~0=v_~x~0_717, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_47|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$r_buff0_thd1~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset, ~x~0] and [341] L777-->L780: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 11:53:06,031 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:53:06,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2400 [2022-12-13 11:53:06,032 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 523 flow [2022-12-13 11:53:06,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:06,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:06,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:06,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:53:06,033 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash 941602959, now seen corresponding path program 1 times [2022-12-13 11:53:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:06,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011706950] [2022-12-13 11:53:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:06,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:06,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011706950] [2022-12-13 11:53:06,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011706950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:06,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:06,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350640315] [2022-12-13 11:53:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:06,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:06,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:06,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 11:53:06,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:06,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:06,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 11:53:06,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:06,496 INFO L130 PetriNetUnfolder]: 687/1307 cut-off events. [2022-12-13 11:53:06,496 INFO L131 PetriNetUnfolder]: For 5623/5772 co-relation queries the response was YES. [2022-12-13 11:53:06,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6419 conditions, 1307 events. 687/1307 cut-off events. For 5623/5772 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7514 event pairs, 86 based on Foata normal form. 121/1129 useless extension candidates. Maximal degree in co-relation 6389. Up to 652 conditions per place. [2022-12-13 11:53:06,503 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 48 selfloop transitions, 1 changer transitions 49/113 dead transitions. [2022-12-13 11:53:06,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 113 transitions, 1132 flow [2022-12-13 11:53:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 11:53:06,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6397058823529411 [2022-12-13 11:53:06,504 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 523 flow. Second operand 4 states and 87 transitions. [2022-12-13 11:53:06,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 113 transitions, 1132 flow [2022-12-13 11:53:06,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 113 transitions, 950 flow, removed 43 selfloop flow, removed 9 redundant places. [2022-12-13 11:53:06,518 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 314 flow [2022-12-13 11:53:06,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2022-12-13 11:53:06,518 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2022-12-13 11:53:06,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:06,518 INFO L89 Accepts]: Start accepts. Operand has 65 places, 52 transitions, 314 flow [2022-12-13 11:53:06,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:06,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:06,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 52 transitions, 314 flow [2022-12-13 11:53:06,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 52 transitions, 314 flow [2022-12-13 11:53:06,541 INFO L130 PetriNetUnfolder]: 148/384 cut-off events. [2022-12-13 11:53:06,541 INFO L131 PetriNetUnfolder]: For 339/341 co-relation queries the response was YES. [2022-12-13 11:53:06,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 384 events. 148/384 cut-off events. For 339/341 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2343 event pairs, 2 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 1191. Up to 190 conditions per place. [2022-12-13 11:53:06,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 52 transitions, 314 flow [2022-12-13 11:53:06,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-13 11:53:06,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [514] $Ultimate##0-->L751: Formula: (and (= v_~x~0_817 1) (= v_~a~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_817, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [342] L780-->L787: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_125 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0))))) (and (= v_~x$w_buff1_used~0_104 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff0_thd2~0_32 (ite .cse1 0 v_~x$r_buff0_thd2~0_33)) (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_51 (ite .cse0 v_~x$w_buff1~0_46 v_~x~0_80))) (= (ite .cse4 0 v_~x$w_buff0_used~0_126) v_~x$w_buff0_used~0_125)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$w_buff1~0=v_~x$w_buff1~0_46, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$w_buff1~0=v_~x$w_buff1~0_46, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_79, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:53:06,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [514] $Ultimate##0-->L751: Formula: (and (= v_~x~0_817 1) (= v_~a~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_817, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:53:07,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] $Ultimate##0-->L806: Formula: (and (= v_~z~0_42 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_31| v_P2Thread1of1ForFork0_~arg.offset_31) (= v_~a~0_46 v_~__unbuffered_p2_EBX~0_130) (= v_~y~0_94 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_31| v_P2Thread1of1ForFork0_~arg.base_31) (= v_~z~0_42 v_~__unbuffered_p2_EAX~0_130)) InVars {~a~0=v_~a~0_46, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|} OutVars{~a~0=v_~a~0_46, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_130, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ~z~0=v_~z~0_42, ~y~0=v_~y~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0] and [521] $Ultimate##0-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_218 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_929 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_212 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_930 256) 0)) .cse5)) (.cse0 (and .cse5 .cse2)) (.cse4 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_860 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_212) v_~x$r_buff0_thd3~0_211) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= (ite .cse1 0 v_~x$w_buff0_used~0_930) v_~x$w_buff0_used~0_929) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_211 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_859 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_218) v_~x$r_buff1_thd3~0_217) (= (ite .cse1 v_~x$w_buff0~0_635 (ite .cse4 v_~x$w_buff1~0_589 1)) v_~x~0_835) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~a~0_52 1) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_860) v_~x$w_buff1_used~0_859)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_635, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_589, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_218, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_860, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_212, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_930} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_635, ~a~0=v_~a~0_52, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_589, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_217, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_859, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_211, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_835, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_929} AuxVars[] AssignedVars[~a~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff0_thd3~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] [2022-12-13 11:53:07,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L780: Formula: (and (= v_~x$r_buff0_thd2~0_252 1) (= v_~x$r_buff0_thd1~0_183 v_~x$r_buff1_thd1~0_187) (= v_~y~0_90 v_~__unbuffered_p1_EAX~0_168) (= v_~x$r_buff0_thd3~0_201 v_~x$r_buff1_thd3~0_207) (= v_~x$r_buff0_thd0~0_507 v_~x$r_buff1_thd0~0_510) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_841 256) 0)) (not (= (mod v_~x$w_buff0_used~0_909 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|) (= v_~x$w_buff0_used~0_909 1) (= v_~x$r_buff0_thd2~0_253 v_~x$r_buff1_thd2~0_195) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_59| |v_P1Thread1of1ForFork2_~arg#1.offset_59|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_59| |v_P1Thread1of1ForFork2_~arg#1.base_59|) (= v_~x$w_buff0~0_624 v_~x$w_buff1~0_579) (= 2 v_~x$w_buff0~0_623) (= v_~x$w_buff0_used~0_910 v_~x$w_buff1_used~0_841) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_624, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_507, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_201, ~y~0=v_~y~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_253, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_910, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_623, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_59|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_507, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, ~x$w_buff1~0=v_~x$w_buff1~0_579, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_207, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_195, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_841, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_201, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_252, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_510, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_909, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|, ~y~0=v_~y~0_90, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_59|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] and [517] $Ultimate##0-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_214 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_208 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_917 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_918 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_848 256) 0))))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_208) v_~x$r_buff0_thd3~0_207) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_848) v_~x$w_buff1_used~0_847) (= v_~a~0_44 v_~__unbuffered_p2_EBX~0_128) (= (ite .cse2 0 v_~x$w_buff0_used~0_918) v_~x$w_buff0_used~0_917) (= v_~z~0_40 v_~__unbuffered_p2_EAX~0_128) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= v_~y~0_92 1) (= v_~z~0_40 1) (= v_~x~0_823 (ite .cse2 v_~x$w_buff0~0_629 (ite .cse1 v_~x$w_buff1~0_583 v_~x~0_824))) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_847 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_207 256) 0)))) 0 v_~x$r_buff1_thd3~0_214) v_~x$r_buff1_thd3~0_213)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_629, ~a~0=v_~a~0_44, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_214, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_848, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_208, ~x~0=v_~x~0_824, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_918} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_629, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_583, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_847, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_207, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_917, ~a~0=v_~a~0_44, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~z~0=v_~z~0_40, ~y~0=v_~y~0_92, ~x~0=v_~x~0_823, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~z~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:53:07,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L780: Formula: (and (= v_~x$r_buff0_thd2~0_252 1) (= v_~x$r_buff0_thd1~0_183 v_~x$r_buff1_thd1~0_187) (= v_~y~0_90 v_~__unbuffered_p1_EAX~0_168) (= v_~x$r_buff0_thd3~0_201 v_~x$r_buff1_thd3~0_207) (= v_~x$r_buff0_thd0~0_507 v_~x$r_buff1_thd0~0_510) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_841 256) 0)) (not (= (mod v_~x$w_buff0_used~0_909 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|) (= v_~x$w_buff0_used~0_909 1) (= v_~x$r_buff0_thd2~0_253 v_~x$r_buff1_thd2~0_195) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_59| |v_P1Thread1of1ForFork2_~arg#1.offset_59|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_59| |v_P1Thread1of1ForFork2_~arg#1.base_59|) (= v_~x$w_buff0~0_624 v_~x$w_buff1~0_579) (= 2 v_~x$w_buff0~0_623) (= v_~x$w_buff0_used~0_910 v_~x$w_buff1_used~0_841) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_624, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_507, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_201, ~y~0=v_~y~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_253, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_910, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_623, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_59|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_507, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, ~x$w_buff1~0=v_~x$w_buff1~0_579, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_207, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_195, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_841, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_201, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_252, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_510, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_909, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_168, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|, ~y~0=v_~y~0_90, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_59|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] and [523] $Ultimate##0-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_222 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_216 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_937 256))))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_868 256) 0)) .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_938 256) 0))))) (and (= v_~a~0_57 v_~__unbuffered_p2_EBX~0_132) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_216) v_~x$r_buff0_thd3~0_215) (= v_~a~0_56 1) (= v_~z~0_44 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_~x$w_buff1_used~0_867 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_868)) (= |v_P2Thread1of1ForFork0_#in~arg.base_33| v_P2Thread1of1ForFork0_~arg.base_33) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_867 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_215 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_222) v_~x$r_buff1_thd3~0_221) (= v_~z~0_44 v_~__unbuffered_p2_EAX~0_132) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~y~0_96 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_33| v_P2Thread1of1ForFork0_~arg.offset_33) (= (ite .cse4 v_~x$w_buff0~0_639 (ite .cse1 v_~x$w_buff1~0_593 1)) v_~x~0_843) (= v_~x$w_buff0_used~0_937 (ite .cse4 0 v_~x$w_buff0_used~0_938))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_639, ~a~0=v_~a~0_57, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_593, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_222, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_868, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_216, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_938} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_639, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_132, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_593, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_867, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_215, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_937, ~a~0=v_~a~0_56, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_33, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_132, ~z~0=v_~z~0_44, ~y~0=v_~y~0_96, ~x~0=v_~x~0_843, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~a~0, P2Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~x~0] [2022-12-13 11:53:07,741 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 11:53:07,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1226 [2022-12-13 11:53:07,745 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 347 flow [2022-12-13 11:53:07,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:07,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:07,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:07,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:53:07,745 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:53:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1547858690, now seen corresponding path program 1 times [2022-12-13 11:53:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:07,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459588266] [2022-12-13 11:53:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:53:07,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:53:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:53:07,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:53:07,802 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:53:07,802 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:53:07,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:53:07,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:53:07,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:53:07,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:53:07,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:53:07,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:53:07,805 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:07,808 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:53:07,808 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:53:07,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:53:07 BasicIcfg [2022-12-13 11:53:07,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:53:07,845 INFO L158 Benchmark]: Toolchain (without parser) took 26776.25ms. Allocated memory was 204.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 178.6MB in the beginning and 1.1GB in the end (delta: -913.1MB). Peak memory consumption was 161.1MB. Max. memory is 8.0GB. [2022-12-13 11:53:07,845 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:53:07,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.39ms. Allocated memory is still 204.5MB. Free memory was 178.6MB in the beginning and 151.9MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 11:53:07,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 204.5MB. Free memory was 151.4MB in the beginning and 148.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:53:07,845 INFO L158 Benchmark]: Boogie Preprocessor took 44.22ms. Allocated memory is still 204.5MB. Free memory was 148.8MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:53:07,845 INFO L158 Benchmark]: RCFGBuilder took 588.36ms. Allocated memory is still 204.5MB. Free memory was 147.2MB in the beginning and 111.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-13 11:53:07,846 INFO L158 Benchmark]: TraceAbstraction took 25647.68ms. Allocated memory was 204.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 110.5MB in the beginning and 1.1GB in the end (delta: -981.3MB). Peak memory consumption was 93.0MB. Max. memory is 8.0GB. [2022-12-13 11:53:07,846 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 431.39ms. Allocated memory is still 204.5MB. Free memory was 178.6MB in the beginning and 151.9MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 204.5MB. Free memory was 151.4MB in the beginning and 148.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.22ms. Allocated memory is still 204.5MB. Free memory was 148.8MB in the beginning and 147.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 588.36ms. Allocated memory is still 204.5MB. Free memory was 147.2MB in the beginning and 111.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 25647.68ms. Allocated memory was 204.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 110.5MB in the beginning and 1.1GB in the end (delta: -981.3MB). Peak memory consumption was 93.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 117 PlacesBefore, 72 PlacesAfterwards, 109 TransitionsBefore, 64 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 3273, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1992, independent: 1932, independent conditional: 0, independent unconditional: 1932, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1992, independent: 1850, independent conditional: 0, independent unconditional: 1850, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 142, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3451, independent: 1341, independent conditional: 0, independent unconditional: 1341, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1992, unknown conditional: 0, unknown unconditional: 1992] , Statistics on independence cache: Total cache size (in pairs): 3324, Positive cache size: 3264, Positive conditional cache size: 0, Positive unconditional cache size: 3264, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, 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.1s, 43 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 552, independent: 483, independent conditional: 483, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 552, independent: 483, independent conditional: 37, independent unconditional: 446, dependent: 69, dependent conditional: 10, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 552, independent: 483, independent conditional: 37, independent unconditional: 446, dependent: 69, dependent conditional: 10, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 552, independent: 483, independent conditional: 37, independent unconditional: 446, dependent: 69, dependent conditional: 10, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 239, independent conditional: 17, independent unconditional: 222, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 266, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 44, dependent conditional: 7, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 552, independent: 244, independent conditional: 20, independent unconditional: 224, dependent: 42, dependent conditional: 8, dependent unconditional: 34, unknown: 266, unknown conditional: 19, unknown unconditional: 247] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 18, Positive unconditional cache size: 228, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, 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, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 243, independent: 211, independent conditional: 3, independent unconditional: 208, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 243, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 243, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 243, independent: 182, independent conditional: 0, independent unconditional: 182, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 275, Positive conditional cache size: 18, Positive unconditional cache size: 257, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 174, independent conditional: 174, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 204, independent: 174, independent conditional: 8, independent unconditional: 166, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 204, independent: 174, independent conditional: 5, independent unconditional: 169, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204, independent: 174, independent conditional: 5, independent unconditional: 169, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 61, dependent conditional: 4, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 204, independent: 161, independent conditional: 5, independent unconditional: 156, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 24, unknown conditional: 2, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 288, Positive conditional cache size: 18, Positive unconditional cache size: 270, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 125, independent conditional: 125, 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: 145, independent: 125, independent conditional: 8, independent unconditional: 117, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 125, independent conditional: 7, independent unconditional: 118, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 125, independent conditional: 7, independent unconditional: 118, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, independent: 115, independent conditional: 7, independent unconditional: 108, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 14, unknown conditional: 2, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 298, Positive conditional cache size: 18, Positive unconditional cache size: 280, Negative cache size: 44, Negative conditional cache size: 6, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 48 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 237, independent conditional: 237, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 237, independent conditional: 80, independent unconditional: 157, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 237, independent conditional: 24, independent unconditional: 213, 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: 260, independent: 237, independent conditional: 24, independent unconditional: 213, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 260, independent: 236, independent conditional: 24, independent unconditional: 212, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 335, Positive conditional cache size: 18, Positive unconditional cache size: 317, Negative cache size: 45, Negative conditional cache size: 6, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 147, independent conditional: 23, independent unconditional: 124, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 147, independent conditional: 23, independent unconditional: 124, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 147, independent conditional: 23, independent unconditional: 124, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 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] ], Cache Queries: [ total: 162, independent: 143, independent conditional: 21, independent unconditional: 122, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 339, Positive conditional cache size: 20, Positive unconditional cache size: 319, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, 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.2s, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 406, independent: 368, independent conditional: 368, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 406, independent: 368, independent conditional: 63, independent unconditional: 305, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 406, independent: 368, independent conditional: 54, independent unconditional: 314, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 406, independent: 368, independent conditional: 54, independent unconditional: 314, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 406, independent: 362, independent conditional: 48, independent unconditional: 314, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 351, Positive conditional cache size: 26, Positive unconditional cache size: 325, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 215, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 215, independent: 192, independent conditional: 27, independent unconditional: 165, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 215, independent: 192, independent conditional: 22, independent unconditional: 170, 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: 215, independent: 192, independent conditional: 22, independent unconditional: 170, 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: 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: 215, independent: 192, independent conditional: 22, independent unconditional: 170, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 351, Positive conditional cache size: 26, Positive unconditional cache size: 325, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 932 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 288, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 288, independent: 258, independent conditional: 34, independent unconditional: 224, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 288, independent: 258, independent conditional: 24, independent unconditional: 234, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 288, independent: 258, independent conditional: 24, independent unconditional: 234, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 288, independent: 258, independent conditional: 24, independent unconditional: 234, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 351, Positive conditional cache size: 26, Positive unconditional cache size: 325, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, 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, 59 PlacesBefore, 59 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 958 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 317, independent: 285, independent conditional: 285, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 317, independent: 285, independent conditional: 35, independent unconditional: 250, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 317, independent: 285, independent conditional: 24, independent unconditional: 261, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 317, independent: 285, independent conditional: 24, independent unconditional: 261, dependent: 32, dependent conditional: 0, dependent unconditional: 32, 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: 317, independent: 285, independent conditional: 24, independent unconditional: 261, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 351, Positive conditional cache size: 26, Positive unconditional cache size: 325, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 998 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 334, independent: 299, independent conditional: 299, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 334, independent: 299, independent conditional: 36, independent unconditional: 263, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 334, independent: 299, independent conditional: 24, independent unconditional: 275, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 334, independent: 299, independent conditional: 24, independent unconditional: 275, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 334, independent: 299, independent conditional: 24, independent unconditional: 275, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 351, Positive conditional cache size: 26, Positive unconditional cache size: 325, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, 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.4s, 65 PlacesBefore, 64 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 1066 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 529, independent: 439, independent conditional: 439, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 529, independent: 439, independent conditional: 141, independent unconditional: 298, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 529, independent: 439, independent conditional: 141, independent unconditional: 298, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 529, independent: 439, independent conditional: 141, independent unconditional: 298, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 529, independent: 433, independent conditional: 135, independent unconditional: 298, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 364, Positive conditional cache size: 32, Positive unconditional cache size: 332, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, 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: 1.4s, 72 PlacesBefore, 71 PlacesAfterwards, 139 TransitionsBefore, 135 TransitionsAfterwards, 1528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1843, independent: 1773, independent conditional: 1773, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1843, independent: 1773, independent conditional: 990, independent unconditional: 783, dependent: 70, dependent conditional: 30, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1843, independent: 1773, independent conditional: 930, independent unconditional: 843, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1843, independent: 1773, independent conditional: 930, independent unconditional: 843, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 2, independent unconditional: 7, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 1843, independent: 1764, independent conditional: 928, independent unconditional: 836, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 9, unknown conditional: 2, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 530, Positive conditional cache size: 34, Positive unconditional cache size: 496, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 72 PlacesBefore, 72 PlacesAfterwards, 116 TransitionsBefore, 115 TransitionsAfterwards, 1418 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 701, independent: 682, independent conditional: 682, 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: 701, independent: 682, independent conditional: 343, independent unconditional: 339, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 701, independent: 682, independent conditional: 276, independent unconditional: 406, 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: 701, independent: 682, independent conditional: 276, independent unconditional: 406, 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: 14, independent: 14, independent conditional: 9, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 701, independent: 668, independent conditional: 267, independent unconditional: 401, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 14, unknown conditional: 9, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 550, Positive conditional cache size: 43, Positive unconditional cache size: 507, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 207, independent conditional: 207, 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: 216, independent: 207, independent conditional: 81, independent unconditional: 126, 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: 216, independent: 207, independent conditional: 63, independent unconditional: 144, 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: 216, independent: 207, independent conditional: 63, independent unconditional: 144, 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: 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: 216, independent: 207, independent conditional: 63, independent unconditional: 144, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 550, Positive conditional cache size: 43, Positive unconditional cache size: 507, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, 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.1s, 73 PlacesBefore, 73 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1008 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 463, independent: 445, independent conditional: 445, 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: 463, independent: 445, independent conditional: 219, independent unconditional: 226, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 463, independent: 445, independent conditional: 182, independent unconditional: 263, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 463, independent: 445, independent conditional: 182, independent unconditional: 263, dependent: 18, dependent conditional: 0, dependent unconditional: 18, 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: 463, independent: 445, independent conditional: 182, independent unconditional: 263, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 602, Positive cache size: 556, Positive conditional cache size: 43, Positive unconditional cache size: 513, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 71 PlacesBefore, 69 PlacesAfterwards, 67 TransitionsBefore, 65 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 203, independent conditional: 203, 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: 223, independent: 203, independent conditional: 62, independent unconditional: 141, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 203, independent conditional: 59, independent unconditional: 144, 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: 223, independent: 203, independent conditional: 59, independent unconditional: 144, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 223, independent: 202, independent conditional: 59, independent unconditional: 143, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 592, Positive conditional cache size: 43, Positive unconditional cache size: 549, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 60 PlacesBefore, 56 PlacesAfterwards, 52 TransitionsBefore, 48 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 142, independent conditional: 142, 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: 142, independent: 142, independent conditional: 101, independent unconditional: 41, 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: 142, independent: 142, independent conditional: 84, independent unconditional: 58, 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: 142, independent: 142, independent conditional: 84, independent unconditional: 58, 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: 17, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 142, independent: 125, independent conditional: 69, independent unconditional: 56, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 15, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 746, Positive conditional cache size: 62, Positive unconditional cache size: 684, Negative cache size: 46, Negative conditional cache size: 6, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-3, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-2, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 [L750] 1 x = 1 [L782] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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: 831]: 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: 833]: 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: 835]: 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, 141 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: 25.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 439 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1775 IncrementalHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 23 mSDtfsCounter, 1775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1837occurred in iteration=13, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:53:07,868 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...