/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/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:29:42,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:29:42,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:29:42,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:29:42,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:29:42,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:29:42,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:29:42,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:29:42,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:29:42,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:29:42,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:29:42,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:29:42,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:29:42,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:29:42,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:29:42,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:29:42,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:29:42,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:29:42,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:29:42,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:29:42,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:29:42,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:29:42,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:29:42,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:29:42,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:29:42,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:29:42,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:29:42,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:29:42,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:29:42,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:29:42,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:29:42,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:29:42,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:29:42,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:29:42,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:29:42,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:29:42,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:29:42,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:29:42,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:29:42,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:29:42,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:29:42,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:29:42,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:29:42,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:29:42,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:29:42,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:29:42,165 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:29:42,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:29:42,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:29:42,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:29:42,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:29:42,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:29:42,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:29:42,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:29:42,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:29:42,167 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:29:42,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:29:42,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:29:42,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:29:42,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:29:42,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:29:42,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:29:42,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:29:42,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:29:42,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:29:42,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:29:42,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:29:42,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:29:42,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:29:42,169 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:29:42,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:29:42,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:29:42,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:29:42,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:29:42,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:29:42,507 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:29:42,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2022-12-06 06:29:43,675 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:29:43,963 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:29:43,963 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2022-12-06 06:29:43,975 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f763f5ce3/70516804e4544e65b0f2e4e18379563c/FLAG9421b6b0b [2022-12-06 06:29:43,992 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f763f5ce3/70516804e4544e65b0f2e4e18379563c [2022-12-06 06:29:43,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:29:43,996 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:29:43,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:29:43,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:29:44,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:29:44,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:43" (1/1) ... [2022-12-06 06:29:44,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1bc52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44, skipping insertion in model container [2022-12-06 06:29:44,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:43" (1/1) ... [2022-12-06 06:29:44,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:29:44,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:29:44,237 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/mix052_tso.oepc.i[949,962] [2022-12-06 06:29:44,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:29:44,458 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:29:44,466 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/mix052_tso.oepc.i[949,962] [2022-12-06 06:29:44,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:44,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:44,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:29:44,541 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:29:44,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44 WrapperNode [2022-12-06 06:29:44,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:29:44,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:29:44,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:29:44,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:29:44,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,598 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-06 06:29:44,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:29:44,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:29:44,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:29:44,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:29:44,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,621 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:29:44,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:29:44,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:29:44,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:29:44,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (1/1) ... [2022-12-06 06:29:44,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:29:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:29:44,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:29:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:29:44,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:29:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:29:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:29:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:29:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:29:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:29:44,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:29:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:29:44,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:29:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:29:44,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:29:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:29:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:29:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:29:44,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:29:44,700 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:29:44,822 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:29:44,824 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:29:45,176 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:29:45,314 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:29:45,314 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:29:45,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:45 BoogieIcfgContainer [2022-12-06 06:29:45,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:29:45,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:29:45,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:29:45,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:29:45,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:29:43" (1/3) ... [2022-12-06 06:29:45,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c399088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:45, skipping insertion in model container [2022-12-06 06:29:45,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:44" (2/3) ... [2022-12-06 06:29:45,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c399088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:45, skipping insertion in model container [2022-12-06 06:29:45,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:45" (3/3) ... [2022-12-06 06:29:45,329 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2022-12-06 06:29:45,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:29:45,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:29:45,347 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:29:45,416 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:29:45,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:29:45,504 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:29:45,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:45,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:29:45,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 06:29:45,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 06:29:45,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:45,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:29:45,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 06:29:45,609 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 06:29:45,611 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:45,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:29:45,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 06:29:45,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-06 06:29:51,107 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:29:51,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:29:51,127 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;@f3fd729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:29:51,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:29:51,130 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:29:51,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:51,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:51,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:29:51,132 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-06 06:29:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash 445801751, now seen corresponding path program 1 times [2022-12-06 06:29:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:51,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625164934] [2022-12-06 06:29:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:51,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:51,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-06 06:29:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:51,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625164934] [2022-12-06 06:29:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625164934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:29:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638192729] [2022-12-06 06:29:51,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:51,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:29:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:51,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:29:51,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:29:51,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:29:51,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:51,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:51,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:29:51,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:51,906 INFO L130 PetriNetUnfolder]: 879/1434 cut-off events. [2022-12-06 06:29:51,907 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:29:51,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1434 events. 879/1434 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7517 event pairs, 144 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2790. Up to 1060 conditions per place. [2022-12-06 06:29:51,918 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 06:29:51,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-06 06:29:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:29:51,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 06:29:51,930 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:29:51,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-06 06:29:51,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:29:51,934 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-06 06:29:51,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 06:29:51,939 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:29:51,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:51,940 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-06 06:29:51,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:51,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:51,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-06 06:29:51,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:29:51,949 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:29:51,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:51,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:29:51,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:29:51,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 06:29:52,026 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:52,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 06:29:52,029 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:29:52,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:52,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:52,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:52,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:29:52,034 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-06 06:29:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 331213688, now seen corresponding path program 1 times [2022-12-06 06:29:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:52,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425592956] [2022-12-06 06:29:52,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:52,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425592956] [2022-12-06 06:29:52,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425592956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:52,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:52,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:29:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572196119] [2022-12-06 06:29:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:52,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:52,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:29:52,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:52,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:52,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:29:52,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:52,883 INFO L130 PetriNetUnfolder]: 1161/1723 cut-off events. [2022-12-06 06:29:52,884 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-06 06:29:52,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 1723 events. 1161/1723 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7537 event pairs, 213 based on Foata normal form. 15/1738 useless extension candidates. Maximal degree in co-relation 3613. Up to 1617 conditions per place. [2022-12-06 06:29:52,897 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 38 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2022-12-06 06:29:52,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 206 flow [2022-12-06 06:29:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:29:52,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:29:52,899 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:29:52,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 206 flow [2022-12-06 06:29:52,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:52,902 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 103 flow [2022-12-06 06:29:52,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-06 06:29:52,903 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:29:52,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:52,903 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 103 flow [2022-12-06 06:29:52,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:52,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:52,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 103 flow [2022-12-06 06:29:52,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 103 flow [2022-12-06 06:29:52,947 INFO L130 PetriNetUnfolder]: 61/148 cut-off events. [2022-12-06 06:29:52,947 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 06:29:52,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 148 events. 61/148 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 626 event pairs, 37 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 302. Up to 95 conditions per place. [2022-12-06 06:29:52,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 103 flow [2022-12-06 06:29:52,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-06 06:29:52,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [340] L793-->L796: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 06:29:52,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [417] L2-1-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_257 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_126 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_258 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_225 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5))) (and (= v_~x$w_buff0_used~0_257 (ite .cse0 0 v_~x$w_buff0_used~0_258)) (= v_~x$w_buff1_used~0_224 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_225)) (= v_~x$r_buff1_thd0~0_125 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_125 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_224 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_126)) (= (ite .cse0 v_~x$w_buff0~0_151 (ite .cse1 v_~x$w_buff1~0_130 v_~x~0_193)) v_~x~0_192) (= v_~x$r_buff0_thd0~0_125 (ite .cse2 0 v_~x$r_buff0_thd0~0_126))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ~x$w_buff1~0=v_~x$w_buff1~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_225, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_126, ~x~0=v_~x~0_193, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_258} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~x$w_buff1~0=v_~x$w_buff1~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_224, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_125, ~x~0=v_~x~0_192, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_257} 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-06 06:29:53,052 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [424] $Ultimate##0-->L773: Formula: (and (= v_~x$r_buff0_thd2~0_60 1) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_61) (= v_~x$w_buff0_used~0_272 v_~x$w_buff1_used~0_235) (= v_~x$r_buff0_thd0~0_135 v_~x$r_buff1_thd0~0_131) (= v_~x$r_buff1_thd3~0_82 v_~x$r_buff0_thd3~0_87) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_271 256) 0)) (not (= (mod v_~x$w_buff1_used~0_235 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_47 v_~x$r_buff0_thd1~0_49) (= 2 v_~x$w_buff0~0_161) (= v_~x$w_buff0~0_162 v_~x$w_buff1~0_137) (= v_~x$w_buff0_used~0_271 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_162, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_161, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_137, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_82, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_235, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_47, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_271, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 06:29:53,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [341] L796-->L803: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_110) v_~x$w_buff0_used~0_109) (= v_~x$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_97)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} 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-06 06:29:53,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:53,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-06 06:29:53,286 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 115 flow [2022-12-06 06:29:53,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:53,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:53,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:53,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:29:53,287 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-06 06:29:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1677690520, now seen corresponding path program 1 times [2022-12-06 06:29:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:53,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754757355] [2022-12-06 06:29:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:53,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754757355] [2022-12-06 06:29:53,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754757355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:53,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:53,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990833219] [2022-12-06 06:29:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:53,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:53,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:53,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 06:29:53,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 115 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:53,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:53,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 06:29:53,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:54,213 INFO L130 PetriNetUnfolder]: 1178/1735 cut-off events. [2022-12-06 06:29:54,213 INFO L131 PetriNetUnfolder]: For 804/804 co-relation queries the response was YES. [2022-12-06 06:29:54,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4589 conditions, 1735 events. 1178/1735 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7204 event pairs, 315 based on Foata normal form. 12/1747 useless extension candidates. Maximal degree in co-relation 4577. Up to 1602 conditions per place. [2022-12-06 06:29:54,227 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 39 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2022-12-06 06:29:54,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 319 flow [2022-12-06 06:29:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 06:29:54,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2022-12-06 06:29:54,231 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 115 flow. Second operand 4 states and 53 transitions. [2022-12-06 06:29:54,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 319 flow [2022-12-06 06:29:54,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 319 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:29:54,234 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 239 flow [2022-12-06 06:29:54,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2022-12-06 06:29:54,236 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-06 06:29:54,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:54,236 INFO L89 Accepts]: Start accepts. Operand has 37 places, 38 transitions, 239 flow [2022-12-06 06:29:54,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:54,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:54,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 38 transitions, 239 flow [2022-12-06 06:29:54,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 38 transitions, 239 flow [2022-12-06 06:29:54,267 INFO L130 PetriNetUnfolder]: 132/262 cut-off events. [2022-12-06 06:29:54,267 INFO L131 PetriNetUnfolder]: For 221/256 co-relation queries the response was YES. [2022-12-06 06:29:54,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 262 events. 132/262 cut-off events. For 221/256 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1171 event pairs, 51 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 788. Up to 157 conditions per place. [2022-12-06 06:29:54,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 38 transitions, 239 flow [2022-12-06 06:29:54,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 06:29:54,323 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:54,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 06:29:54,324 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 239 flow [2022-12-06 06:29:54,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:54,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:54,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:54,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:29:54,325 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-06 06:29:54,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1677697030, now seen corresponding path program 2 times [2022-12-06 06:29:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:54,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035320429] [2022-12-06 06:29:54,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:54,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035320429] [2022-12-06 06:29:54,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035320429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:54,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:54,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960772254] [2022-12-06 06:29:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:54,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:54,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:29:54,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:54,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:54,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:29:54,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:55,064 INFO L130 PetriNetUnfolder]: 1021/1574 cut-off events. [2022-12-06 06:29:55,064 INFO L131 PetriNetUnfolder]: For 1889/1933 co-relation queries the response was YES. [2022-12-06 06:29:55,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5001 conditions, 1574 events. 1021/1574 cut-off events. For 1889/1933 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7138 event pairs, 315 based on Foata normal form. 20/1548 useless extension candidates. Maximal degree in co-relation 4985. Up to 1246 conditions per place. [2022-12-06 06:29:55,074 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 40 selfloop transitions, 15 changer transitions 0/59 dead transitions. [2022-12-06 06:29:55,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 421 flow [2022-12-06 06:29:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 06:29:55,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-06 06:29:55,080 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 239 flow. Second operand 4 states and 54 transitions. [2022-12-06 06:29:55,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 421 flow [2022-12-06 06:29:55,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 407 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 06:29:55,087 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 292 flow [2022-12-06 06:29:55,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2022-12-06 06:29:55,088 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-06 06:29:55,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:55,088 INFO L89 Accepts]: Start accepts. Operand has 41 places, 42 transitions, 292 flow [2022-12-06 06:29:55,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:55,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:55,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 42 transitions, 292 flow [2022-12-06 06:29:55,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 42 transitions, 292 flow [2022-12-06 06:29:55,131 INFO L130 PetriNetUnfolder]: 166/314 cut-off events. [2022-12-06 06:29:55,131 INFO L131 PetriNetUnfolder]: For 427/454 co-relation queries the response was YES. [2022-12-06 06:29:55,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 314 events. 166/314 cut-off events. For 427/454 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1373 event pairs, 67 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 1021. Up to 176 conditions per place. [2022-12-06 06:29:55,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 42 transitions, 292 flow [2022-12-06 06:29:55,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:29:56,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:56,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1092 [2022-12-06 06:29:56,181 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 296 flow [2022-12-06 06:29:56,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:56,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:56,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:56,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:29:56,181 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-06 06:29:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash -936682329, now seen corresponding path program 1 times [2022-12-06 06:29:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:56,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759519914] [2022-12-06 06:29:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:56,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759519914] [2022-12-06 06:29:56,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759519914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:56,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:56,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993488614] [2022-12-06 06:29:56,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:56,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:56,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:56,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:56,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 06:29:56,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:56,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:56,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 06:29:56,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:56,900 INFO L130 PetriNetUnfolder]: 989/1531 cut-off events. [2022-12-06 06:29:56,900 INFO L131 PetriNetUnfolder]: For 2931/3015 co-relation queries the response was YES. [2022-12-06 06:29:56,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 1531 events. 989/1531 cut-off events. For 2931/3015 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6968 event pairs, 218 based on Foata normal form. 15/1502 useless extension candidates. Maximal degree in co-relation 5294. Up to 1174 conditions per place. [2022-12-06 06:29:56,912 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 43 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2022-12-06 06:29:56,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 432 flow [2022-12-06 06:29:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 06:29:56,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 06:29:56,914 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 296 flow. Second operand 3 states and 42 transitions. [2022-12-06 06:29:56,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 432 flow [2022-12-06 06:29:56,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 408 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:56,918 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 278 flow [2022-12-06 06:29:56,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2022-12-06 06:29:56,918 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 06:29:56,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:56,919 INFO L89 Accepts]: Start accepts. Operand has 42 places, 41 transitions, 278 flow [2022-12-06 06:29:56,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:56,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:56,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 41 transitions, 278 flow [2022-12-06 06:29:56,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 278 flow [2022-12-06 06:29:56,956 INFO L130 PetriNetUnfolder]: 155/298 cut-off events. [2022-12-06 06:29:56,956 INFO L131 PetriNetUnfolder]: For 432/456 co-relation queries the response was YES. [2022-12-06 06:29:56,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 298 events. 155/298 cut-off events. For 432/456 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1288 event pairs, 62 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 983. Up to 163 conditions per place. [2022-12-06 06:29:56,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 41 transitions, 278 flow [2022-12-06 06:29:56,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 06:29:56,961 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:56,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 06:29:56,963 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 278 flow [2022-12-06 06:29:56,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:56,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:56,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:56,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:29:56,963 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-06 06:29:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash -936655421, now seen corresponding path program 1 times [2022-12-06 06:29:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:56,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117921701] [2022-12-06 06:29:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:57,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:57,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117921701] [2022-12-06 06:29:57,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117921701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:57,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:57,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089510611] [2022-12-06 06:29:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:57,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:57,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:29:57,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:57,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:57,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:29:57,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:57,627 INFO L130 PetriNetUnfolder]: 1086/1665 cut-off events. [2022-12-06 06:29:57,628 INFO L131 PetriNetUnfolder]: For 3501/3612 co-relation queries the response was YES. [2022-12-06 06:29:57,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 1665 events. 1086/1665 cut-off events. For 3501/3612 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7641 event pairs, 207 based on Foata normal form. 10/1633 useless extension candidates. Maximal degree in co-relation 5942. Up to 1253 conditions per place. [2022-12-06 06:29:57,640 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 50 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2022-12-06 06:29:57,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 508 flow [2022-12-06 06:29:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:29:57,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:29:57,642 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 278 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:29:57,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 508 flow [2022-12-06 06:29:57,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:57,646 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 337 flow [2022-12-06 06:29:57,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2022-12-06 06:29:57,646 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 06:29:57,646 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:57,647 INFO L89 Accepts]: Start accepts. Operand has 44 places, 46 transitions, 337 flow [2022-12-06 06:29:57,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:57,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:57,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 46 transitions, 337 flow [2022-12-06 06:29:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 46 transitions, 337 flow [2022-12-06 06:29:57,691 INFO L130 PetriNetUnfolder]: 201/361 cut-off events. [2022-12-06 06:29:57,692 INFO L131 PetriNetUnfolder]: For 771/804 co-relation queries the response was YES. [2022-12-06 06:29:57,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 361 events. 201/361 cut-off events. For 771/804 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1564 event pairs, 59 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 1359. Up to 209 conditions per place. [2022-12-06 06:29:57,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 46 transitions, 337 flow [2022-12-06 06:29:57,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 06:29:57,698 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:57,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 06:29:57,699 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 337 flow [2022-12-06 06:29:57,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:57,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:57,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:57,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:29:57,700 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-06 06:29:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1790633575, now seen corresponding path program 1 times [2022-12-06 06:29:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:57,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140325102] [2022-12-06 06:29:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:58,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:58,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140325102] [2022-12-06 06:29:58,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140325102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:58,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:58,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101542021] [2022-12-06 06:29:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:58,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:58,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:29:58,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:58,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:58,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:29:58,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:58,344 INFO L130 PetriNetUnfolder]: 1208/1854 cut-off events. [2022-12-06 06:29:58,344 INFO L131 PetriNetUnfolder]: For 5256/5413 co-relation queries the response was YES. [2022-12-06 06:29:58,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7215 conditions, 1854 events. 1208/1854 cut-off events. For 5256/5413 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8709 event pairs, 211 based on Foata normal form. 51/1865 useless extension candidates. Maximal degree in co-relation 7194. Up to 1301 conditions per place. [2022-12-06 06:29:58,361 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 47 selfloop transitions, 26 changer transitions 0/77 dead transitions. [2022-12-06 06:29:58,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 646 flow [2022-12-06 06:29:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:29:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:29:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 06:29:58,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2022-12-06 06:29:58,363 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 337 flow. Second operand 6 states and 62 transitions. [2022-12-06 06:29:58,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 646 flow [2022-12-06 06:29:58,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 614 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:58,369 INFO L231 Difference]: Finished difference. Result has 48 places, 60 transitions, 503 flow [2022-12-06 06:29:58,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=503, PETRI_PLACES=48, PETRI_TRANSITIONS=60} [2022-12-06 06:29:58,370 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-12-06 06:29:58,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:58,370 INFO L89 Accepts]: Start accepts. Operand has 48 places, 60 transitions, 503 flow [2022-12-06 06:29:58,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:58,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:58,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 60 transitions, 503 flow [2022-12-06 06:29:58,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 60 transitions, 503 flow [2022-12-06 06:29:58,424 INFO L130 PetriNetUnfolder]: 228/411 cut-off events. [2022-12-06 06:29:58,424 INFO L131 PetriNetUnfolder]: For 1138/1185 co-relation queries the response was YES. [2022-12-06 06:29:58,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 411 events. 228/411 cut-off events. For 1138/1185 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1885 event pairs, 59 based on Foata normal form. 3/401 useless extension candidates. Maximal degree in co-relation 1816. Up to 243 conditions per place. [2022-12-06 06:29:58,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 60 transitions, 503 flow [2022-12-06 06:29:58,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 06:29:58,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L744-->L796: Formula: (and (= v_~x~0_364 1) (= v_~z~0_34 v_~__unbuffered_p2_EAX~0_81)) InVars {~z~0=v_~z~0_34} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~z~0=v_~z~0_34, ~x~0=v_~x~0_364} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0, ~x~0] and [417] L2-1-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_257 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_126 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_258 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_225 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5))) (and (= v_~x$w_buff0_used~0_257 (ite .cse0 0 v_~x$w_buff0_used~0_258)) (= v_~x$w_buff1_used~0_224 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_225)) (= v_~x$r_buff1_thd0~0_125 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_125 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_224 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_126)) (= (ite .cse0 v_~x$w_buff0~0_151 (ite .cse1 v_~x$w_buff1~0_130 v_~x~0_193)) v_~x~0_192) (= v_~x$r_buff0_thd0~0_125 (ite .cse2 0 v_~x$r_buff0_thd0~0_126))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ~x$w_buff1~0=v_~x$w_buff1~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_225, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_126, ~x~0=v_~x~0_193, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_258} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~x$w_buff1~0=v_~x$w_buff1~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_224, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_125, ~x~0=v_~x~0_192, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_257} 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-06 06:29:58,632 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L744-->L796: Formula: (and (= v_~x~0_364 1) (= v_~z~0_34 v_~__unbuffered_p2_EAX~0_81)) InVars {~z~0=v_~z~0_34} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~z~0=v_~z~0_34, ~x~0=v_~x~0_364} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0, ~x~0] and [326] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_108 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109)) (= (ite .cse2 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x~0_85 (ite .cse2 v_~x$w_buff0~0_53 (ite .cse1 v_~x$w_buff1~0_48 v_~x~0_86))) (= v_~x$r_buff1_thd1~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_108 256) 0)))) 0 v_~x$r_buff1_thd1~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_20) v_~x$r_buff0_thd1~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} 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-06 06:29:58,791 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L744-->L796: Formula: (and (= v_~x~0_364 1) (= v_~z~0_34 v_~__unbuffered_p2_EAX~0_81)) InVars {~z~0=v_~z~0_34} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_81, ~z~0=v_~z~0_34, ~x~0=v_~x~0_364} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0, ~x~0] and [424] $Ultimate##0-->L773: Formula: (and (= v_~x$r_buff0_thd2~0_60 1) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_61) (= v_~x$w_buff0_used~0_272 v_~x$w_buff1_used~0_235) (= v_~x$r_buff0_thd0~0_135 v_~x$r_buff1_thd0~0_131) (= v_~x$r_buff1_thd3~0_82 v_~x$r_buff0_thd3~0_87) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_271 256) 0)) (not (= (mod v_~x$w_buff1_used~0_235 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_47 v_~x$r_buff0_thd1~0_49) (= 2 v_~x$w_buff0~0_161) (= v_~x$w_buff0~0_162 v_~x$w_buff1~0_137) (= v_~x$w_buff0_used~0_271 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_162, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_161, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_137, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_82, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_235, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_47, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_271, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 06:29:58,902 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:58,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 533 [2022-12-06 06:29:58,903 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 59 transitions, 528 flow [2022-12-06 06:29:58,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:58,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:58,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:58,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:29:58,904 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-06 06:29:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash -936656165, now seen corresponding path program 1 times [2022-12-06 06:29:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265884637] [2022-12-06 06:29:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:59,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-06 06:29:59,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:59,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265884637] [2022-12-06 06:29:59,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265884637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:59,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:59,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:59,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329478053] [2022-12-06 06:29:59,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:59,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:59,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:59,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:59,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:59,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:29:59,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 59 transitions, 528 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:59,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:59,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:29:59,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:59,719 INFO L130 PetriNetUnfolder]: 1204/1853 cut-off events. [2022-12-06 06:29:59,719 INFO L131 PetriNetUnfolder]: For 7110/7288 co-relation queries the response was YES. [2022-12-06 06:29:59,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8105 conditions, 1853 events. 1204/1853 cut-off events. For 7110/7288 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8653 event pairs, 202 based on Foata normal form. 55/1880 useless extension candidates. Maximal degree in co-relation 8083. Up to 1430 conditions per place. [2022-12-06 06:29:59,740 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 54 selfloop transitions, 28 changer transitions 0/86 dead transitions. [2022-12-06 06:29:59,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 863 flow [2022-12-06 06:29:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 06:29:59,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4206896551724138 [2022-12-06 06:29:59,743 INFO L175 Difference]: Start difference. First operand has 47 places, 59 transitions, 528 flow. Second operand 5 states and 61 transitions. [2022-12-06 06:29:59,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 86 transitions, 863 flow [2022-12-06 06:29:59,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 840 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 06:29:59,752 INFO L231 Difference]: Finished difference. Result has 52 places, 70 transitions, 720 flow [2022-12-06 06:29:59,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=720, PETRI_PLACES=52, PETRI_TRANSITIONS=70} [2022-12-06 06:29:59,755 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-06 06:29:59,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:59,755 INFO L89 Accepts]: Start accepts. Operand has 52 places, 70 transitions, 720 flow [2022-12-06 06:29:59,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:59,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:59,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 70 transitions, 720 flow [2022-12-06 06:29:59,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 70 transitions, 720 flow [2022-12-06 06:29:59,823 INFO L130 PetriNetUnfolder]: 241/428 cut-off events. [2022-12-06 06:29:59,823 INFO L131 PetriNetUnfolder]: For 1940/2022 co-relation queries the response was YES. [2022-12-06 06:29:59,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 428 events. 241/428 cut-off events. For 1940/2022 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1910 event pairs, 52 based on Foata normal form. 3/416 useless extension candidates. Maximal degree in co-relation 2217. Up to 255 conditions per place. [2022-12-06 06:29:59,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 70 transitions, 720 flow [2022-12-06 06:29:59,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 06:29:59,838 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:59,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 06:29:59,840 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 70 transitions, 720 flow [2022-12-06 06:29:59,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:59,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:59,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:59,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:29:59,841 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-06 06:29:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1264162545, now seen corresponding path program 1 times [2022-12-06 06:29:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:59,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137053719] [2022-12-06 06:29:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:00,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:00,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137053719] [2022-12-06 06:30:00,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137053719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:00,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:00,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173123060] [2022-12-06 06:30:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:00,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:00,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:00,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:00,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:00,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:30:00,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 70 transitions, 720 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:00,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:00,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:30:00,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:00,730 INFO L130 PetriNetUnfolder]: 1359/2088 cut-off events. [2022-12-06 06:30:00,731 INFO L131 PetriNetUnfolder]: For 11985/12236 co-relation queries the response was YES. [2022-12-06 06:30:00,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10016 conditions, 2088 events. 1359/2088 cut-off events. For 11985/12236 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10151 event pairs, 200 based on Foata normal form. 143/2184 useless extension candidates. Maximal degree in co-relation 9991. Up to 1375 conditions per place. [2022-12-06 06:30:00,749 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 57 selfloop transitions, 34 changer transitions 0/95 dead transitions. [2022-12-06 06:30:00,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 1066 flow [2022-12-06 06:30:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 06:30:00,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:30:00,751 INFO L175 Difference]: Start difference. First operand has 52 places, 70 transitions, 720 flow. Second operand 4 states and 58 transitions. [2022-12-06 06:30:00,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 1066 flow [2022-12-06 06:30:00,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 1010 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:00,769 INFO L231 Difference]: Finished difference. Result has 54 places, 76 transitions, 854 flow [2022-12-06 06:30:00,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=854, PETRI_PLACES=54, PETRI_TRANSITIONS=76} [2022-12-06 06:30:00,770 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-06 06:30:00,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:00,770 INFO L89 Accepts]: Start accepts. Operand has 54 places, 76 transitions, 854 flow [2022-12-06 06:30:00,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:00,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:00,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 76 transitions, 854 flow [2022-12-06 06:30:00,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 76 transitions, 854 flow [2022-12-06 06:30:00,832 INFO L130 PetriNetUnfolder]: 260/471 cut-off events. [2022-12-06 06:30:00,832 INFO L131 PetriNetUnfolder]: For 2615/2701 co-relation queries the response was YES. [2022-12-06 06:30:00,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 471 events. 260/471 cut-off events. For 2615/2701 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2275 event pairs, 53 based on Foata normal form. 5/455 useless extension candidates. Maximal degree in co-relation 2647. Up to 274 conditions per place. [2022-12-06 06:30:00,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 76 transitions, 854 flow [2022-12-06 06:30:00,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 06:30:00,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:00,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 06:30:00,846 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 76 transitions, 854 flow [2022-12-06 06:30:00,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:00,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:00,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:00,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:30:00,847 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-06 06:30:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1027614697, now seen corresponding path program 1 times [2022-12-06 06:30:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:00,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777244497] [2022-12-06 06:30:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:01,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777244497] [2022-12-06 06:30:01,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777244497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:01,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:01,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390523335] [2022-12-06 06:30:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:01,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:01,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:01,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:01,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:01,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:30:01,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 76 transitions, 854 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:01,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:01,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:30:01,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:01,652 INFO L130 PetriNetUnfolder]: 1458/2251 cut-off events. [2022-12-06 06:30:01,652 INFO L131 PetriNetUnfolder]: For 15640/15958 co-relation queries the response was YES. [2022-12-06 06:30:01,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11533 conditions, 2251 events. 1458/2251 cut-off events. For 15640/15958 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11269 event pairs, 211 based on Foata normal form. 184/2386 useless extension candidates. Maximal degree in co-relation 11507. Up to 1366 conditions per place. [2022-12-06 06:30:01,676 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 60 selfloop transitions, 38 changer transitions 0/102 dead transitions. [2022-12-06 06:30:01,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 102 transitions, 1185 flow [2022-12-06 06:30:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 06:30:01,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47586206896551725 [2022-12-06 06:30:01,677 INFO L175 Difference]: Start difference. First operand has 54 places, 76 transitions, 854 flow. Second operand 5 states and 69 transitions. [2022-12-06 06:30:01,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 102 transitions, 1185 flow [2022-12-06 06:30:01,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 102 transitions, 1124 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:01,699 INFO L231 Difference]: Finished difference. Result has 57 places, 78 transitions, 938 flow [2022-12-06 06:30:01,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=938, PETRI_PLACES=57, PETRI_TRANSITIONS=78} [2022-12-06 06:30:01,700 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-06 06:30:01,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:01,700 INFO L89 Accepts]: Start accepts. Operand has 57 places, 78 transitions, 938 flow [2022-12-06 06:30:01,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:01,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:01,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 78 transitions, 938 flow [2022-12-06 06:30:01,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 78 transitions, 938 flow [2022-12-06 06:30:01,764 INFO L130 PetriNetUnfolder]: 274/509 cut-off events. [2022-12-06 06:30:01,765 INFO L131 PetriNetUnfolder]: For 3064/3155 co-relation queries the response was YES. [2022-12-06 06:30:01,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 509 events. 274/509 cut-off events. For 3064/3155 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2578 event pairs, 61 based on Foata normal form. 7/495 useless extension candidates. Maximal degree in co-relation 2849. Up to 290 conditions per place. [2022-12-06 06:30:01,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 78 transitions, 938 flow [2022-12-06 06:30:01,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 06:30:01,780 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:01,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 06:30:01,781 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 78 transitions, 938 flow [2022-12-06 06:30:01,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:01,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:01,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:01,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:30:01,782 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-06 06:30:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1028450767, now seen corresponding path program 2 times [2022-12-06 06:30:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:01,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921328589] [2022-12-06 06:30:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:02,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:02,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921328589] [2022-12-06 06:30:02,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921328589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:02,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:02,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117358488] [2022-12-06 06:30:02,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:02,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:02,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 06:30:02,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 78 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:02,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:02,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 06:30:02,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:02,978 INFO L130 PetriNetUnfolder]: 1533/2387 cut-off events. [2022-12-06 06:30:02,978 INFO L131 PetriNetUnfolder]: For 17112/17392 co-relation queries the response was YES. [2022-12-06 06:30:02,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12254 conditions, 2387 events. 1533/2387 cut-off events. For 17112/17392 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12202 event pairs, 226 based on Foata normal form. 148/2484 useless extension candidates. Maximal degree in co-relation 12227. Up to 1252 conditions per place. [2022-12-06 06:30:03,000 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 63 selfloop transitions, 49 changer transitions 0/116 dead transitions. [2022-12-06 06:30:03,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 116 transitions, 1437 flow [2022-12-06 06:30:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 06:30:03,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2022-12-06 06:30:03,002 INFO L175 Difference]: Start difference. First operand has 57 places, 78 transitions, 938 flow. Second operand 5 states and 72 transitions. [2022-12-06 06:30:03,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 116 transitions, 1437 flow [2022-12-06 06:30:03,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 116 transitions, 1393 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:03,022 INFO L231 Difference]: Finished difference. Result has 61 places, 90 transitions, 1239 flow [2022-12-06 06:30:03,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1239, PETRI_PLACES=61, PETRI_TRANSITIONS=90} [2022-12-06 06:30:03,023 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-06 06:30:03,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:03,023 INFO L89 Accepts]: Start accepts. Operand has 61 places, 90 transitions, 1239 flow [2022-12-06 06:30:03,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:03,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:03,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 90 transitions, 1239 flow [2022-12-06 06:30:03,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 90 transitions, 1239 flow [2022-12-06 06:30:03,098 INFO L130 PetriNetUnfolder]: 288/546 cut-off events. [2022-12-06 06:30:03,099 INFO L131 PetriNetUnfolder]: For 4631/4755 co-relation queries the response was YES. [2022-12-06 06:30:03,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 546 events. 288/546 cut-off events. For 4631/4755 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2886 event pairs, 51 based on Foata normal form. 5/532 useless extension candidates. Maximal degree in co-relation 3346. Up to 304 conditions per place. [2022-12-06 06:30:03,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 90 transitions, 1239 flow [2022-12-06 06:30:03,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 06:30:04,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:04,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1217 [2022-12-06 06:30:04,240 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 90 transitions, 1251 flow [2022-12-06 06:30:04,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:04,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:04,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:30:04,241 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-06 06:30:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1647788567, now seen corresponding path program 1 times [2022-12-06 06:30:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:04,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777415180] [2022-12-06 06:30:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:04,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777415180] [2022-12-06 06:30:04,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777415180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:04,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:04,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849691643] [2022-12-06 06:30:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:04,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:30:04,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 90 transitions, 1251 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:04,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:04,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:30:04,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:04,587 INFO L130 PetriNetUnfolder]: 734/1251 cut-off events. [2022-12-06 06:30:04,587 INFO L131 PetriNetUnfolder]: For 13444/13521 co-relation queries the response was YES. [2022-12-06 06:30:04,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7096 conditions, 1251 events. 734/1251 cut-off events. For 13444/13521 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6342 event pairs, 147 based on Foata normal form. 98/1307 useless extension candidates. Maximal degree in co-relation 7067. Up to 886 conditions per place. [2022-12-06 06:30:04,601 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 94 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2022-12-06 06:30:04,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 1586 flow [2022-12-06 06:30:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:30:04,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:30:04,603 INFO L175 Difference]: Start difference. First operand has 62 places, 90 transitions, 1251 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:30:04,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 1586 flow [2022-12-06 06:30:04,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 104 transitions, 1429 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-12-06 06:30:04,622 INFO L231 Difference]: Finished difference. Result has 58 places, 76 transitions, 926 flow [2022-12-06 06:30:04,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=58, PETRI_TRANSITIONS=76} [2022-12-06 06:30:04,622 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-06 06:30:04,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:04,622 INFO L89 Accepts]: Start accepts. Operand has 58 places, 76 transitions, 926 flow [2022-12-06 06:30:04,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:04,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:04,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 76 transitions, 926 flow [2022-12-06 06:30:04,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 76 transitions, 926 flow [2022-12-06 06:30:04,714 INFO L130 PetriNetUnfolder]: 261/555 cut-off events. [2022-12-06 06:30:04,714 INFO L131 PetriNetUnfolder]: For 3044/3140 co-relation queries the response was YES. [2022-12-06 06:30:04,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 555 events. 261/555 cut-off events. For 3044/3140 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3298 event pairs, 68 based on Foata normal form. 4/522 useless extension candidates. Maximal degree in co-relation 2729. Up to 263 conditions per place. [2022-12-06 06:30:04,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 76 transitions, 926 flow [2022-12-06 06:30:04,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 06:30:05,277 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:05,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 656 [2022-12-06 06:30:05,278 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 75 transitions, 913 flow [2022-12-06 06:30:05,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:05,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:05,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:05,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:30:05,279 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-06 06:30:05,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1189985856, now seen corresponding path program 1 times [2022-12-06 06:30:05,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:05,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010453331] [2022-12-06 06:30:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:05,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:05,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010453331] [2022-12-06 06:30:05,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010453331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:05,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:05,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127901913] [2022-12-06 06:30:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:05,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:05,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:05,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 06:30:05,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 75 transitions, 913 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:05,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:05,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 06:30:05,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:05,576 INFO L130 PetriNetUnfolder]: 360/664 cut-off events. [2022-12-06 06:30:05,576 INFO L131 PetriNetUnfolder]: For 5167/5194 co-relation queries the response was YES. [2022-12-06 06:30:05,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 664 events. 360/664 cut-off events. For 5167/5194 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3109 event pairs, 76 based on Foata normal form. 88/734 useless extension candidates. Maximal degree in co-relation 3637. Up to 234 conditions per place. [2022-12-06 06:30:05,582 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 97 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2022-12-06 06:30:05,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 1450 flow [2022-12-06 06:30:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:30:05,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-06 06:30:05,584 INFO L175 Difference]: Start difference. First operand has 58 places, 75 transitions, 913 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:30:05,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 1450 flow [2022-12-06 06:30:05,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 1368 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:05,593 INFO L231 Difference]: Finished difference. Result has 60 places, 70 transitions, 781 flow [2022-12-06 06:30:05,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=781, PETRI_PLACES=60, PETRI_TRANSITIONS=70} [2022-12-06 06:30:05,594 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-12-06 06:30:05,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:05,594 INFO L89 Accepts]: Start accepts. Operand has 60 places, 70 transitions, 781 flow [2022-12-06 06:30:05,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:05,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:05,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 70 transitions, 781 flow [2022-12-06 06:30:05,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 70 transitions, 781 flow [2022-12-06 06:30:05,644 INFO L130 PetriNetUnfolder]: 109/272 cut-off events. [2022-12-06 06:30:05,644 INFO L131 PetriNetUnfolder]: For 1376/1423 co-relation queries the response was YES. [2022-12-06 06:30:05,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 272 events. 109/272 cut-off events. For 1376/1423 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1319 event pairs, 17 based on Foata normal form. 15/274 useless extension candidates. Maximal degree in co-relation 1363. Up to 114 conditions per place. [2022-12-06 06:30:05,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 70 transitions, 781 flow [2022-12-06 06:30:05,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 06:30:06,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:06,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 541 [2022-12-06 06:30:06,135 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 70 transitions, 789 flow [2022-12-06 06:30:06,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:06,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:06,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:06,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:30:06,136 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-06 06:30:06,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash 242133980, now seen corresponding path program 1 times [2022-12-06 06:30:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:06,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630860515] [2022-12-06 06:30:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:06,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:06,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630860515] [2022-12-06 06:30:06,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630860515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:06,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:06,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782530078] [2022-12-06 06:30:06,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:06,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:06,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:06,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:06,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 06:30:06,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 70 transitions, 789 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:06,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:06,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 06:30:06,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:06,457 INFO L130 PetriNetUnfolder]: 315/569 cut-off events. [2022-12-06 06:30:06,458 INFO L131 PetriNetUnfolder]: For 4306/4344 co-relation queries the response was YES. [2022-12-06 06:30:06,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 569 events. 315/569 cut-off events. For 4306/4344 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2651 event pairs, 68 based on Foata normal form. 47/600 useless extension candidates. Maximal degree in co-relation 3064. Up to 230 conditions per place. [2022-12-06 06:30:06,463 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 91 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2022-12-06 06:30:06,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 107 transitions, 1353 flow [2022-12-06 06:30:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 06:30:06,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793 [2022-12-06 06:30:06,465 INFO L175 Difference]: Start difference. First operand has 60 places, 70 transitions, 789 flow. Second operand 5 states and 68 transitions. [2022-12-06 06:30:06,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 107 transitions, 1353 flow [2022-12-06 06:30:06,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 107 transitions, 1186 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-12-06 06:30:06,475 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 659 flow [2022-12-06 06:30:06,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=659, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2022-12-06 06:30:06,476 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-12-06 06:30:06,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:06,476 INFO L89 Accepts]: Start accepts. Operand has 60 places, 67 transitions, 659 flow [2022-12-06 06:30:06,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:06,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:06,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 67 transitions, 659 flow [2022-12-06 06:30:06,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 67 transitions, 659 flow [2022-12-06 06:30:06,500 INFO L130 PetriNetUnfolder]: 84/206 cut-off events. [2022-12-06 06:30:06,500 INFO L131 PetriNetUnfolder]: For 839/867 co-relation queries the response was YES. [2022-12-06 06:30:06,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 206 events. 84/206 cut-off events. For 839/867 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 960 event pairs, 7 based on Foata normal form. 3/199 useless extension candidates. Maximal degree in co-relation 947. Up to 73 conditions per place. [2022-12-06 06:30:06,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 67 transitions, 659 flow [2022-12-06 06:30:06,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 06:30:07,561 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:07,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1086 [2022-12-06 06:30:07,562 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 655 flow [2022-12-06 06:30:07,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:07,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:07,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:07,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:30:07,562 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-06 06:30:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1789214910, now seen corresponding path program 1 times [2022-12-06 06:30:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:07,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871157378] [2022-12-06 06:30:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:07,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:11,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871157378] [2022-12-06 06:30:11,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871157378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:11,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:11,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657838135] [2022-12-06 06:30:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:11,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:11,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:11,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:11,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:30:11,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 655 flow. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:11,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:11,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:30:11,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:11,894 INFO L130 PetriNetUnfolder]: 536/914 cut-off events. [2022-12-06 06:30:11,894 INFO L131 PetriNetUnfolder]: For 4071/4071 co-relation queries the response was YES. [2022-12-06 06:30:11,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4513 conditions, 914 events. 536/914 cut-off events. For 4071/4071 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4179 event pairs, 50 based on Foata normal form. 1/914 useless extension candidates. Maximal degree in co-relation 4485. Up to 356 conditions per place. [2022-12-06 06:30:11,899 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 66 selfloop transitions, 5 changer transitions 66/137 dead transitions. [2022-12-06 06:30:11,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 137 transitions, 1607 flow [2022-12-06 06:30:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-06 06:30:11,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-06 06:30:11,901 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 655 flow. Second operand 6 states and 57 transitions. [2022-12-06 06:30:11,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 137 transitions, 1607 flow [2022-12-06 06:30:11,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 137 transitions, 1528 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 06:30:11,911 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 436 flow [2022-12-06 06:30:11,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2022-12-06 06:30:11,911 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-12-06 06:30:11,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:11,912 INFO L89 Accepts]: Start accepts. Operand has 62 places, 49 transitions, 436 flow [2022-12-06 06:30:11,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:11,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:11,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 49 transitions, 436 flow [2022-12-06 06:30:11,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 436 flow [2022-12-06 06:30:11,933 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-06 06:30:11,933 INFO L131 PetriNetUnfolder]: For 433/458 co-relation queries the response was YES. [2022-12-06 06:30:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 119 events. 39/119 cut-off events. For 433/458 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 490 event pairs, 3 based on Foata normal form. 5/118 useless extension candidates. Maximal degree in co-relation 499. Up to 39 conditions per place. [2022-12-06 06:30:11,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 49 transitions, 436 flow [2022-12-06 06:30:11,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 06:30:11,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] L744-->L773: Formula: (and (= v_~x$w_buff0_used~0_450 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_25| |v_P1Thread1of1ForFork0_~arg#1.offset_25|) (= v_~x$r_buff0_thd0~0_239 v_~x$r_buff1_thd0~0_237) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_402 256) 0)) (not (= (mod v_~x$w_buff0_used~0_450 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= 2 v_~x$w_buff0~0_286) (= v_~x$w_buff0_used~0_451 v_~x$w_buff1_used~0_402) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= v_~x$r_buff0_thd2~0_118 1) (= v_~x$r_buff0_thd3~0_157 v_~x$r_buff1_thd3~0_149) (= v_~x$r_buff1_thd1~0_86 v_~x$r_buff0_thd1~0_87) (= v_~x$w_buff0~0_287 v_~x$w_buff1~0_252) (= |v_P1Thread1of1ForFork0_~arg#1.base_25| |v_P1Thread1of1ForFork0_#in~arg#1.base_25|) (= v_~x$r_buff1_thd2~0_89 v_~x$r_buff0_thd2~0_119) (= v_~x~0_370 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_287, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_239, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_157, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_119, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_451} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_286, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_239, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_25|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_252, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_149, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_89, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_402, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_86, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_157, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_118, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_237, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_450, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x~0=v_~x~0_370} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~x~0] and [326] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_108 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109)) (= (ite .cse2 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x~0_85 (ite .cse2 v_~x$w_buff0~0_53 (ite .cse1 v_~x$w_buff1~0_48 v_~x~0_86))) (= v_~x$r_buff1_thd1~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_108 256) 0)))) 0 v_~x$r_buff1_thd1~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_20) v_~x$r_buff0_thd1~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} 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-06 06:30:12,149 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:12,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 06:30:12,150 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 443 flow [2022-12-06 06:30:12,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:12,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:12,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:12,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:30:12,151 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-06 06:30:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash -724020189, now seen corresponding path program 1 times [2022-12-06 06:30:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:12,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038791081] [2022-12-06 06:30:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:16,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038791081] [2022-12-06 06:30:16,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038791081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:16,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:16,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697577586] [2022-12-06 06:30:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:16,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:16,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:30:16,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 443 flow. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:16,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:16,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:30:16,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:16,219 INFO L130 PetriNetUnfolder]: 303/543 cut-off events. [2022-12-06 06:30:16,219 INFO L131 PetriNetUnfolder]: For 2535/2535 co-relation queries the response was YES. [2022-12-06 06:30:16,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 543 events. 303/543 cut-off events. For 2535/2535 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2259 event pairs, 36 based on Foata normal form. 1/544 useless extension candidates. Maximal degree in co-relation 2682. Up to 330 conditions per place. [2022-12-06 06:30:16,221 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 42 selfloop transitions, 3 changer transitions 54/99 dead transitions. [2022-12-06 06:30:16,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 1035 flow [2022-12-06 06:30:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 06:30:16,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 06:30:16,228 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 443 flow. Second operand 6 states and 49 transitions. [2022-12-06 06:30:16,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 1035 flow [2022-12-06 06:30:16,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 99 transitions, 951 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-06 06:30:16,235 INFO L231 Difference]: Finished difference. Result has 58 places, 35 transitions, 263 flow [2022-12-06 06:30:16,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=58, PETRI_TRANSITIONS=35} [2022-12-06 06:30:16,236 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-06 06:30:16,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:16,236 INFO L89 Accepts]: Start accepts. Operand has 58 places, 35 transitions, 263 flow [2022-12-06 06:30:16,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:16,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:16,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 35 transitions, 263 flow [2022-12-06 06:30:16,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 35 transitions, 263 flow [2022-12-06 06:30:16,247 INFO L130 PetriNetUnfolder]: 22/74 cut-off events. [2022-12-06 06:30:16,247 INFO L131 PetriNetUnfolder]: For 177/178 co-relation queries the response was YES. [2022-12-06 06:30:16,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 74 events. 22/74 cut-off events. For 177/178 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 219 event pairs, 1 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 283. Up to 24 conditions per place. [2022-12-06 06:30:16,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 35 transitions, 263 flow [2022-12-06 06:30:16,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 06:30:16,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_108 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109)) (= (ite .cse2 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x~0_85 (ite .cse2 v_~x$w_buff0~0_53 (ite .cse1 v_~x$w_buff1~0_48 v_~x~0_86))) (= v_~x$r_buff1_thd1~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_108 256) 0)))) 0 v_~x$r_buff1_thd1~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_20) v_~x$r_buff0_thd1~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [334] L776-->L783: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_117 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= v_~x~0_89 (ite .cse0 v_~x$w_buff0~0_61 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_90))) (= v_~x$w_buff0_used~0_135 (ite .cse0 0 v_~x$w_buff0_used~0_136)) (= v_~x$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_117)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_116 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_27) v_~x$r_buff0_thd2~0_26)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_117, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_116, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} 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-06 06:30:16,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] $Ultimate##0-->L776: Formula: (and (= v_~x$w_buff0_used~0_541 v_~x$w_buff1_used~0_486) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| 0)) (= v_~x$r_buff0_thd2~0_142 1) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_486 256) 0)) (not (= (mod v_~x$w_buff0_used~0_540 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~x$r_buff0_thd3~0_175 v_~x$r_buff1_thd3~0_167) (= v_~x$w_buff0~0_341 v_~x$w_buff1~0_300) (= v_~x$w_buff0_used~0_540 1) (= v_~x$r_buff0_thd2~0_143 v_~x$r_buff1_thd2~0_107) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_31| |v_P1Thread1of1ForFork0_~arg#1.offset_31|) (= v_~x$r_buff0_thd1~0_107 v_~x$r_buff1_thd1~0_106) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_88) (= |v_P1Thread1of1ForFork0_~arg#1.base_31| |v_P1Thread1of1ForFork0_#in~arg#1.base_31|) (= 2 v_~x$w_buff0~0_340) (= v_~x$r_buff0_thd0~0_291 v_~x$r_buff1_thd0~0_289)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_341, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_291, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_175, ~y~0=v_~y~0_32, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_541} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_340, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_291, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_31|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_300, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_167, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_107, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_486, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_106, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_142, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_289, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_540, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] and [468] $Ultimate##0-->L803: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd3~0_172 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_180 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_556 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_557 256) 0)))) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_499 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_498 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd3~0_179 256) 0)))) 0 v_~x$r_buff1_thd3~0_172) v_~x$r_buff1_thd3~0_171) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_180) v_~x$r_buff0_thd3~0_179) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_56 v_~__unbuffered_p2_EAX~0_107) (= v_~y~0_36 1) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~x$w_buff1_used~0_498 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_499)) (= (ite .cse4 0 v_~x$w_buff0_used~0_557) v_~x$w_buff0_used~0_556) (= (ite .cse4 v_~x$w_buff0~0_350 (ite .cse3 v_~x$w_buff1~0_306 v_~x~0_467)) v_~x~0_466)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_350, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_172, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_180, ~z~0=v_~z~0_56, ~x~0=v_~x~0_467, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_557} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~x$w_buff1~0=v_~x$w_buff1~0_306, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_171, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_498, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_179, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_56, ~y~0=v_~y~0_36, ~x~0=v_~x~0_466} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:30:16,975 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:30:16,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 740 [2022-12-06 06:30:16,976 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 292 flow [2022-12-06 06:30:16,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:16,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:16,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:16,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:30:16,977 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-06 06:30:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:16,977 INFO L85 PathProgramCache]: Analyzing trace with hash -559965934, now seen corresponding path program 1 times [2022-12-06 06:30:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:16,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544082232] [2022-12-06 06:30:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:30:17,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:30:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:30:17,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:30:17,071 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:30:17,072 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:30:17,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:30:17,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:30:17,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:30:17,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:30:17,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:30:17,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:30:17,076 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:17,080 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:30:17,080 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:30:17,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:30:17 BasicIcfg [2022-12-06 06:30:17,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:30:17,160 INFO L158 Benchmark]: Toolchain (without parser) took 33164.67ms. Allocated memory was 208.7MB in the beginning and 821.0MB in the end (delta: 612.4MB). Free memory was 184.6MB in the beginning and 509.1MB in the end (delta: -324.5MB). Peak memory consumption was 288.8MB. Max. memory is 8.0GB. [2022-12-06 06:30:17,161 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 186.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:30:17,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.36ms. Allocated memory is still 208.7MB. Free memory was 184.0MB in the beginning and 158.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:30:17,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.81ms. Allocated memory is still 208.7MB. Free memory was 157.8MB in the beginning and 155.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:30:17,161 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 208.7MB. Free memory was 155.3MB in the beginning and 153.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:30:17,161 INFO L158 Benchmark]: RCFGBuilder took 690.52ms. Allocated memory is still 208.7MB. Free memory was 153.6MB in the beginning and 118.6MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:30:17,162 INFO L158 Benchmark]: TraceAbstraction took 31841.64ms. Allocated memory was 208.7MB in the beginning and 821.0MB in the end (delta: 612.4MB). Free memory was 118.0MB in the beginning and 509.1MB in the end (delta: -391.1MB). Peak memory consumption was 221.7MB. Max. memory is 8.0GB. [2022-12-06 06:30:17,163 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.12ms. Allocated memory is still 208.7MB. Free memory is still 186.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.36ms. Allocated memory is still 208.7MB. Free memory was 184.0MB in the beginning and 158.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.81ms. Allocated memory is still 208.7MB. Free memory was 157.8MB in the beginning and 155.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 208.7MB. Free memory was 155.3MB in the beginning and 153.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 690.52ms. Allocated memory is still 208.7MB. Free memory was 153.6MB in the beginning and 118.6MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 31841.64ms. Allocated memory was 208.7MB in the beginning and 821.0MB in the end (delta: 612.4MB). Free memory was 118.0MB in the beginning and 509.1MB in the end (delta: -391.1MB). Peak memory consumption was 221.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 113 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1338, independent: 1280, independent conditional: 1280, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1338, independent: 1280, independent conditional: 0, independent unconditional: 1280, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1338, independent: 1280, independent conditional: 0, independent unconditional: 1280, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1338, independent: 1280, independent conditional: 0, independent unconditional: 1280, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1118, independent: 1080, independent conditional: 0, independent unconditional: 1080, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1118, independent: 1066, independent conditional: 0, independent unconditional: 1066, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 313, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1338, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1118, unknown conditional: 0, unknown unconditional: 1118] , Statistics on independence cache: Total cache size (in pairs): 1675, Positive cache size: 1637, Positive conditional cache size: 0, Positive unconditional cache size: 1637, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 9, independent unconditional: 76, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, independent: 85, independent conditional: 9, independent unconditional: 76, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 85, independent conditional: 9, independent unconditional: 76, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, independent: 77, independent conditional: 8, independent unconditional: 69, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 66, dependent conditional: 12, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 91, unknown conditional: 10, unknown unconditional: 81] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 77, Positive conditional cache size: 8, Positive unconditional cache size: 69, Negative cache size: 14, Negative conditional cache size: 2, Negative unconditional cache size: 12, 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.3s, 33 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, independent: 251, independent conditional: 251, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 282, independent: 251, independent conditional: 65, independent unconditional: 186, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, independent: 251, independent conditional: 28, independent unconditional: 223, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, independent: 251, independent conditional: 28, independent unconditional: 223, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 6, independent unconditional: 7, 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: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, independent: 238, independent conditional: 22, independent unconditional: 216, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 106, Positive conditional cache size: 14, Positive unconditional cache size: 92, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, 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: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 235, independent conditional: 235, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 257, independent: 235, independent conditional: 73, independent unconditional: 162, dependent: 22, dependent conditional: 12, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 235, independent conditional: 64, independent unconditional: 171, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 235, independent conditional: 64, independent unconditional: 171, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 5, independent unconditional: 10, 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: 17, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 220, independent conditional: 59, independent unconditional: 161, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 17, unknown conditional: 5, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 121, Positive conditional cache size: 19, Positive unconditional cache size: 102, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 41 PlacesBefore, 41 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 503, independent: 465, independent conditional: 465, 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: 503, independent: 465, independent conditional: 154, independent unconditional: 311, dependent: 38, dependent conditional: 6, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 503, independent: 465, independent conditional: 134, independent unconditional: 331, 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: 503, independent: 465, independent conditional: 134, independent unconditional: 331, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 503, independent: 463, independent conditional: 134, independent unconditional: 329, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 126, Positive conditional cache size: 19, Positive unconditional cache size: 107, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 215, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 215, independent: 198, independent conditional: 71, independent unconditional: 127, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 215, independent: 198, independent conditional: 62, independent unconditional: 136, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 215, independent: 198, independent conditional: 62, independent unconditional: 136, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 215, independent: 197, independent conditional: 61, independent unconditional: 136, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 127, Positive conditional cache size: 20, Positive unconditional cache size: 107, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, 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.0s, 44 PlacesBefore, 44 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 253, independent: 233, independent conditional: 233, 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: 253, independent: 233, independent conditional: 90, independent unconditional: 143, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 253, independent: 233, independent conditional: 80, independent unconditional: 153, 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: 253, independent: 233, independent conditional: 80, independent unconditional: 153, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 253, independent: 231, independent conditional: 78, independent unconditional: 153, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 129, Positive conditional cache size: 22, Positive unconditional cache size: 107, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 48 PlacesBefore, 47 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 426, independent: 356, independent conditional: 356, 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: 426, independent: 356, independent conditional: 119, independent unconditional: 237, 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: 426, independent: 356, independent conditional: 95, independent unconditional: 261, 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: 426, independent: 356, independent conditional: 95, independent unconditional: 261, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 426, independent: 353, independent conditional: 95, independent unconditional: 258, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 135, Positive conditional cache size: 22, Positive unconditional cache size: 113, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 366, independent: 318, independent conditional: 318, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 366, independent: 318, independent conditional: 130, independent unconditional: 188, dependent: 48, dependent conditional: 18, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 366, independent: 318, independent conditional: 108, independent unconditional: 210, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 366, independent: 318, independent conditional: 108, independent unconditional: 210, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 366, independent: 313, independent conditional: 103, independent unconditional: 210, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 140, Positive conditional cache size: 27, Positive unconditional cache size: 113, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 412, independent: 361, independent conditional: 361, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 412, independent: 361, independent conditional: 159, independent unconditional: 202, dependent: 51, dependent conditional: 18, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 412, independent: 361, independent conditional: 144, independent unconditional: 217, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 412, independent: 361, independent conditional: 144, independent unconditional: 217, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 412, independent: 358, independent conditional: 141, independent unconditional: 217, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 143, Positive conditional cache size: 30, Positive unconditional cache size: 113, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, independent: 356, independent conditional: 356, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 405, independent: 356, independent conditional: 153, independent unconditional: 203, dependent: 49, dependent conditional: 18, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 405, independent: 356, independent conditional: 142, independent unconditional: 214, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 405, independent: 356, independent conditional: 142, independent unconditional: 214, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 405, independent: 355, independent conditional: 141, independent unconditional: 214, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 144, Positive conditional cache size: 31, Positive unconditional cache size: 113, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 61 PlacesBefore, 62 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1172, independent: 1056, independent conditional: 1056, independent unconditional: 0, dependent: 116, dependent conditional: 116, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1172, independent: 1056, independent conditional: 534, independent unconditional: 522, dependent: 116, dependent conditional: 12, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1172, independent: 1056, independent conditional: 464, independent unconditional: 592, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1172, independent: 1056, independent conditional: 464, independent unconditional: 592, dependent: 116, dependent conditional: 0, dependent unconditional: 116, 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: 1172, independent: 1056, independent conditional: 464, independent unconditional: 592, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 150, Positive conditional cache size: 31, Positive unconditional cache size: 119, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 82, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 58 PlacesBefore, 58 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 391, independent: 361, independent conditional: 361, 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: 391, independent: 361, independent conditional: 170, independent unconditional: 191, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 391, independent: 361, independent conditional: 146, independent unconditional: 215, 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: 391, independent: 361, independent conditional: 146, independent unconditional: 215, 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: 8, independent: 8, independent conditional: 4, independent unconditional: 4, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 391, independent: 353, independent conditional: 142, independent unconditional: 211, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 162, Positive conditional cache size: 35, Positive unconditional cache size: 127, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 60 PlacesBefore, 60 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 96, independent conditional: 96, 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: 126, independent: 96, independent conditional: 50, independent unconditional: 46, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 96, independent conditional: 48, independent unconditional: 48, 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: 126, independent: 96, independent conditional: 48, independent unconditional: 48, 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: 126, independent: 96, independent conditional: 48, independent unconditional: 48, 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): 182, Positive cache size: 165, Positive conditional cache size: 35, Positive unconditional cache size: 130, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 60 PlacesBefore, 58 PlacesAfterwards, 67 TransitionsBefore, 65 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 50, independent conditional: 50, 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: 80, independent: 50, independent conditional: 40, independent unconditional: 10, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 50, independent conditional: 40, independent unconditional: 10, 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: 80, independent: 50, independent conditional: 40, independent unconditional: 10, 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: 80, independent: 50, independent conditional: 40, independent unconditional: 10, 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): 185, Positive cache size: 168, Positive conditional cache size: 35, Positive unconditional cache size: 133, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 60 PlacesBefore, 59 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 140, independent conditional: 140, 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: 158, independent: 140, independent conditional: 87, independent unconditional: 53, 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: 158, independent: 140, independent conditional: 75, independent unconditional: 65, 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: 158, independent: 140, independent conditional: 75, independent unconditional: 65, 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: 7, independent: 5, independent conditional: 5, independent unconditional: 0, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 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] ], Cache Queries: [ total: 158, independent: 135, independent conditional: 70, independent unconditional: 65, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 177, Positive conditional cache size: 40, Positive unconditional cache size: 137, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, 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.7s, 55 PlacesBefore, 52 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 24, independent unconditional: 8, 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: 32, independent: 32, independent conditional: 20, independent unconditional: 12, 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: 32, independent: 32, independent conditional: 20, independent unconditional: 12, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 32, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 224, Positive conditional cache size: 52, Positive unconditional cache size: 172, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={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] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={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] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={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=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] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L792] 3 y = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0] [L743] 1 z = 1 [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L749] 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) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 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 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 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=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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 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) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 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 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 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) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 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)) [L847] 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)) [L848] 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)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=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: 823]: 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: 821]: 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: 825]: 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, 135 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: 31.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1325 IncrementalHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 24 mSDtfsCounter, 1325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1251occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 2544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:30:17,195 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...