/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:29:29,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:29:29,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:29:29,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:29:29,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:29:29,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:29:29,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:29:29,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:29:29,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:29:29,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:29:29,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:29:29,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:29:29,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:29:29,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:29:29,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:29:29,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:29:29,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:29:29,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:29:29,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:29:29,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:29:29,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:29:29,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:29:29,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:29:29,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:29:29,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:29:29,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:29:29,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:29:29,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:29:29,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:29:29,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:29:29,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:29:29,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:29:29,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:29:29,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:29:29,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:29:29,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:29:29,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:29:29,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:29:29,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:29:29,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:29:29,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:29:29,129 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:29:29,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:29:29,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:29:29,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:29:29,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:29:29,162 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:29:29,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:29:29,163 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:29:29,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:29:29,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:29:29,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:29:29,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:29:29,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:29:29,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:29:29,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:29:29,165 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 04:29:29,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:29:29,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:29:29,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:29:29,487 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:29:29,487 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:29:29,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2022-12-06 04:29:30,557 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:29:30,814 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:29:30,815 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2022-12-06 04:29:30,825 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6cae432/d7c5af17383a4f5fac8bd4a61d0683e3/FLAG94bc44877 [2022-12-06 04:29:30,838 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6cae432/d7c5af17383a4f5fac8bd4a61d0683e3 [2022-12-06 04:29:30,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:29:30,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:29:30,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:29:30,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:29:30,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:29:30,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:30" (1/1) ... [2022-12-06 04:29:30,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373656d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:30, skipping insertion in model container [2022-12-06 04:29:30,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:29:30" (1/1) ... [2022-12-06 04:29:30,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:29:30,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:29:31,012 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/safe016_rmo.opt.i[949,962] [2022-12-06 04:29:31,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:29:31,233 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:29:31,242 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/safe016_rmo.opt.i[949,962] [2022-12-06 04:29:31,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:29:31,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:29:31,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:29:31,356 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:29:31,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31 WrapperNode [2022-12-06 04:29:31,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:29:31,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:29:31,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:29:31,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:29:31,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,421 INFO L138 Inliner]: procedures = 177, calls = 89, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 181 [2022-12-06 04:29:31,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:29:31,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:29:31,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:29:31,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:29:31,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,457 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:29:31,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:29:31,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:29:31,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:29:31,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (1/1) ... [2022-12-06 04:29:31,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:29:31,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:29:31,524 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 04:29:31,526 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 04:29:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:29:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:29:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:29:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:29:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:29:31,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:29:31,558 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:29:31,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:29:31,558 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:29:31,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:29:31,558 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:29:31,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:29:31,558 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:29:31,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:29:31,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:29:31,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:29:31,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:29:31,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:29:31,560 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 04:29:31,702 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:29:31,704 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:29:32,162 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:29:32,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:29:32,382 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:29:32,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:32 BoogieIcfgContainer [2022-12-06 04:29:32,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:29:32,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:29:32,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:29:32,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:29:32,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:29:30" (1/3) ... [2022-12-06 04:29:32,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc694d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:32, skipping insertion in model container [2022-12-06 04:29:32,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:29:31" (2/3) ... [2022-12-06 04:29:32,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc694d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:29:32, skipping insertion in model container [2022-12-06 04:29:32,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:29:32" (3/3) ... [2022-12-06 04:29:32,390 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.opt.i [2022-12-06 04:29:32,443 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:29:32,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:29:32,444 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:29:32,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:29:32,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2022-12-06 04:29:32,596 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2022-12-06 04:29:32,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:32,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-06 04:29:32,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2022-12-06 04:29:32,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 264 flow [2022-12-06 04:29:32,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:32,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 126 transitions, 264 flow [2022-12-06 04:29:32,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 126 transitions, 264 flow [2022-12-06 04:29:32,673 INFO L130 PetriNetUnfolder]: 1/126 cut-off events. [2022-12-06 04:29:32,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:32,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 1/126 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/125 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:29:32,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 126 transitions, 264 flow [2022-12-06 04:29:32,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 1950 [2022-12-06 04:29:41,418 INFO L203 LiptonReduction]: Total number of compositions: 102 [2022-12-06 04:29:41,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:29:41,441 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59d7686b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:29:41,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:29:41,446 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:29:41,446 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:41,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:41,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:41,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 512966836, now seen corresponding path program 1 times [2022-12-06 04:29:41,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:41,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847510156] [2022-12-06 04:29:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:41,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:41,660 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 04:29:41,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:41,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847510156] [2022-12-06 04:29:41,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847510156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:41,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:41,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:41,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335582401] [2022-12-06 04:29:41,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:41,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:29:41,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:41,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:29:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:29:41,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 04:29:41,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 04:29:41,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:41,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 04:29:41,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:42,419 INFO L130 PetriNetUnfolder]: 3159/4386 cut-off events. [2022-12-06 04:29:42,419 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 04:29:42,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8914 conditions, 4386 events. 3159/4386 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19932 event pairs, 3159 based on Foata normal form. 0/4369 useless extension candidates. Maximal degree in co-relation 8902. Up to 4353 conditions per place. [2022-12-06 04:29:42,447 INFO L137 encePairwiseOnDemand]: 25/26 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-06 04:29:42,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 108 flow [2022-12-06 04:29:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:29:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:29:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2022-12-06 04:29:42,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 04:29:42,457 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 2 states and 28 transitions. [2022-12-06 04:29:42,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 108 flow [2022-12-06 04:29:42,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:29:42,461 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 58 flow [2022-12-06 04:29:42,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-06 04:29:42,465 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 04:29:42,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:42,466 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 58 flow [2022-12-06 04:29:42,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:42,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:42,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 58 flow [2022-12-06 04:29:42,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 58 flow [2022-12-06 04:29:42,482 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 04:29:42,482 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:42,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:29:42,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 58 flow [2022-12-06 04:29:42,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 04:29:42,563 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:42,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 04:29:42,566 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 58 flow [2022-12-06 04:29:42,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 04:29:42,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:42,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:42,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:29:42,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:42,570 INFO L85 PathProgramCache]: Analyzing trace with hash -960093222, now seen corresponding path program 1 times [2022-12-06 04:29:42,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:42,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186416951] [2022-12-06 04:29:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:42,894 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 04:29:42,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186416951] [2022-12-06 04:29:42,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186416951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:42,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:42,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968609172] [2022-12-06 04:29:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:42,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:42,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:29:42,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:29:42,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:42,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:29:42,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:43,461 INFO L130 PetriNetUnfolder]: 2951/4322 cut-off events. [2022-12-06 04:29:43,461 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:43,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8574 conditions, 4322 events. 2951/4322 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22736 event pairs, 551 based on Foata normal form. 64/4382 useless extension candidates. Maximal degree in co-relation 8566. Up to 3423 conditions per place. [2022-12-06 04:29:43,477 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-06 04:29:43,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 178 flow [2022-12-06 04:29:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 04:29:43,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-06 04:29:43,480 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 58 flow. Second operand 3 states and 47 transitions. [2022-12-06 04:29:43,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 178 flow [2022-12-06 04:29:43,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:29:43,481 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2022-12-06 04:29:43,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-06 04:29:43,482 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2022-12-06 04:29:43,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:43,482 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 66 flow [2022-12-06 04:29:43,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:43,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:43,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-06 04:29:43,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 66 flow [2022-12-06 04:29:43,487 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 04:29:43,487 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:29:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:29:43,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-06 04:29:43,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 04:29:43,490 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:43,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:29:43,491 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2022-12-06 04:29:43,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:29:43,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:43,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:43,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:29:43,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash 301882701, now seen corresponding path program 1 times [2022-12-06 04:29:43,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:43,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740302251] [2022-12-06 04:29:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:43,625 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 04:29:43,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:43,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740302251] [2022-12-06 04:29:43,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740302251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:43,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:43,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:29:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891129516] [2022-12-06 04:29:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:43,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:29:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:29:43,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:29:43,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:29:43,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 04:29:43,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:43,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:29:43,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:44,518 INFO L130 PetriNetUnfolder]: 5485/7824 cut-off events. [2022-12-06 04:29:44,518 INFO L131 PetriNetUnfolder]: For 649/649 co-relation queries the response was YES. [2022-12-06 04:29:44,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16481 conditions, 7824 events. 5485/7824 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 40841 event pairs, 775 based on Foata normal form. 240/8063 useless extension candidates. Maximal degree in co-relation 16470. Up to 3631 conditions per place. [2022-12-06 04:29:44,542 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 44 selfloop transitions, 4 changer transitions 5/54 dead transitions. [2022-12-06 04:29:44,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 237 flow [2022-12-06 04:29:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:29:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:29:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 04:29:44,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-06 04:29:44,544 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 4 states and 59 transitions. [2022-12-06 04:29:44,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 237 flow [2022-12-06 04:29:44,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:44,545 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 88 flow [2022-12-06 04:29:44,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 04:29:44,546 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-06 04:29:44,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:44,546 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 88 flow [2022-12-06 04:29:44,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:44,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:44,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 88 flow [2022-12-06 04:29:44,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 88 flow [2022-12-06 04:29:44,553 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:29:44,553 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 04:29:44,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 39 events. 3/39 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 66. Up to 10 conditions per place. [2022-12-06 04:29:44,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 88 flow [2022-12-06 04:29:44,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 04:29:44,566 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:44,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:29:44,567 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 88 flow [2022-12-06 04:29:44,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 04:29:44,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:44,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:44,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:29:44,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash 768367224, now seen corresponding path program 1 times [2022-12-06 04:29:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:44,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152350593] [2022-12-06 04:29:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:44,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:44,736 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 04:29:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:44,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152350593] [2022-12-06 04:29:44,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152350593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:44,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:44,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:29:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022903096] [2022-12-06 04:29:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:44,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:44,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:44,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:29:44,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 04:29:44,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:44,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:29:44,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:45,223 INFO L130 PetriNetUnfolder]: 2985/4260 cut-off events. [2022-12-06 04:29:45,224 INFO L131 PetriNetUnfolder]: For 1540/1540 co-relation queries the response was YES. [2022-12-06 04:29:45,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10067 conditions, 4260 events. 2985/4260 cut-off events. For 1540/1540 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19977 event pairs, 1350 based on Foata normal form. 36/4264 useless extension candidates. Maximal degree in co-relation 10054. Up to 3616 conditions per place. [2022-12-06 04:29:45,240 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 35 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-06 04:29:45,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 198 flow [2022-12-06 04:29:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:29:45,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 04:29:45,241 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 88 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:29:45,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 198 flow [2022-12-06 04:29:45,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 185 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:29:45,245 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 87 flow [2022-12-06 04:29:45,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 04:29:45,246 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-06 04:29:45,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:45,246 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 87 flow [2022-12-06 04:29:45,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:45,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:45,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 87 flow [2022-12-06 04:29:45,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 87 flow [2022-12-06 04:29:45,253 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:29:45,253 INFO L131 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2022-12-06 04:29:45,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 39 events. 3/39 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 64. Up to 10 conditions per place. [2022-12-06 04:29:45,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 87 flow [2022-12-06 04:29:45,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 04:29:45,305 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:45,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 04:29:45,305 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 87 flow [2022-12-06 04:29:45,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 04:29:45,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:45,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:45,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:29:45,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1948988353, now seen corresponding path program 1 times [2022-12-06 04:29:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:45,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588302169] [2022-12-06 04:29:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:45,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:45,438 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 04:29:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:45,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588302169] [2022-12-06 04:29:45,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588302169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:45,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:45,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:29:45,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612891340] [2022-12-06 04:29:45,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:45,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:45,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:45,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:45,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:29:45,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:29:45,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:45,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:29:45,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:46,103 INFO L130 PetriNetUnfolder]: 4282/6121 cut-off events. [2022-12-06 04:29:46,104 INFO L131 PetriNetUnfolder]: For 1829/1829 co-relation queries the response was YES. [2022-12-06 04:29:46,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13749 conditions, 6121 events. 4282/6121 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 31102 event pairs, 1969 based on Foata normal form. 144/6193 useless extension candidates. Maximal degree in co-relation 13736. Up to 3257 conditions per place. [2022-12-06 04:29:46,126 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-06 04:29:46,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 198 flow [2022-12-06 04:29:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:29:46,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 04:29:46,127 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 87 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:29:46,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 198 flow [2022-12-06 04:29:46,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:46,130 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 94 flow [2022-12-06 04:29:46,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 04:29:46,131 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 04:29:46,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:46,132 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 94 flow [2022-12-06 04:29:46,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:46,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:46,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 94 flow [2022-12-06 04:29:46,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 94 flow [2022-12-06 04:29:46,139 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-06 04:29:46,139 INFO L131 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2022-12-06 04:29:46,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 39 events. 0/39 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 101 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 04:29:46,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 94 flow [2022-12-06 04:29:46,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 04:29:46,147 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:46,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 04:29:46,148 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 94 flow [2022-12-06 04:29:46,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:29:46,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:46,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:46,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:29:46,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1278527037, now seen corresponding path program 1 times [2022-12-06 04:29:46,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:46,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454771703] [2022-12-06 04:29:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:46,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:47,178 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 04:29:47,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454771703] [2022-12-06 04:29:47,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454771703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:47,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:47,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:29:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761391249] [2022-12-06 04:29:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:47,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:29:47,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:29:47,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:29:47,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:29:47,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 04:29:47,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:47,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:29:47,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:47,945 INFO L130 PetriNetUnfolder]: 4827/6752 cut-off events. [2022-12-06 04:29:47,946 INFO L131 PetriNetUnfolder]: For 2716/2766 co-relation queries the response was YES. [2022-12-06 04:29:47,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15563 conditions, 6752 events. 4827/6752 cut-off events. For 2716/2766 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 32502 event pairs, 2497 based on Foata normal form. 3/6750 useless extension candidates. Maximal degree in co-relation 15550. Up to 6636 conditions per place. [2022-12-06 04:29:47,967 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 34 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 04:29:47,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 214 flow [2022-12-06 04:29:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 04:29:47,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 04:29:47,969 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 94 flow. Second operand 3 states and 41 transitions. [2022-12-06 04:29:47,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 214 flow [2022-12-06 04:29:47,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 206 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:47,972 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 122 flow [2022-12-06 04:29:47,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-06 04:29:47,972 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 04:29:47,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:47,973 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 122 flow [2022-12-06 04:29:47,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:47,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:47,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 122 flow [2022-12-06 04:29:47,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 122 flow [2022-12-06 04:29:48,001 INFO L130 PetriNetUnfolder]: 80/229 cut-off events. [2022-12-06 04:29:48,001 INFO L131 PetriNetUnfolder]: For 256/268 co-relation queries the response was YES. [2022-12-06 04:29:48,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 229 events. 80/229 cut-off events. For 256/268 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1255 event pairs, 39 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 489. Up to 139 conditions per place. [2022-12-06 04:29:48,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 122 flow [2022-12-06 04:29:48,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 04:29:48,021 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:48,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:29:48,022 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 122 flow [2022-12-06 04:29:48,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 04:29:48,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:48,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:48,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:29:48,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash 979631359, now seen corresponding path program 1 times [2022-12-06 04:29:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:48,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750934816] [2022-12-06 04:29:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:48,158 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 04:29:48,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:48,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750934816] [2022-12-06 04:29:48,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750934816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:48,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:48,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:29:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887749535] [2022-12-06 04:29:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:48,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:29:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:48,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:29:48,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:29:48,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:29:48,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 04:29:48,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:48,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:29:48,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:48,714 INFO L130 PetriNetUnfolder]: 3334/4833 cut-off events. [2022-12-06 04:29:48,714 INFO L131 PetriNetUnfolder]: For 3297/3352 co-relation queries the response was YES. [2022-12-06 04:29:48,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12406 conditions, 4833 events. 3334/4833 cut-off events. For 3297/3352 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 24870 event pairs, 779 based on Foata normal form. 122/4783 useless extension candidates. Maximal degree in co-relation 12391. Up to 4239 conditions per place. [2022-12-06 04:29:48,733 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 39 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2022-12-06 04:29:48,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 261 flow [2022-12-06 04:29:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:29:48,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-06 04:29:48,735 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 122 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:29:48,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 261 flow [2022-12-06 04:29:48,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:48,737 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 150 flow [2022-12-06 04:29:48,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-06 04:29:48,738 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-06 04:29:48,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:48,738 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 150 flow [2022-12-06 04:29:48,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:48,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:48,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 150 flow [2022-12-06 04:29:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 150 flow [2022-12-06 04:29:48,820 INFO L130 PetriNetUnfolder]: 366/807 cut-off events. [2022-12-06 04:29:48,820 INFO L131 PetriNetUnfolder]: For 899/941 co-relation queries the response was YES. [2022-12-06 04:29:48,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 807 events. 366/807 cut-off events. For 899/941 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5475 event pairs, 199 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 1867. Up to 422 conditions per place. [2022-12-06 04:29:48,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 150 flow [2022-12-06 04:29:48,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 04:29:48,896 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:48,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 04:29:48,897 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 150 flow [2022-12-06 04:29:48,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 04:29:48,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:48,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:48,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:29:48,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash 369087886, now seen corresponding path program 1 times [2022-12-06 04:29:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:48,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248921735] [2022-12-06 04:29:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:49,761 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 04:29:49,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:49,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248921735] [2022-12-06 04:29:49,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248921735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:49,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:49,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:29:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939524368] [2022-12-06 04:29:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:49,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:29:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:29:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:29:49,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:29:49,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:49,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:49,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:29:49,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:50,321 INFO L130 PetriNetUnfolder]: 3338/4857 cut-off events. [2022-12-06 04:29:50,321 INFO L131 PetriNetUnfolder]: For 3605/3650 co-relation queries the response was YES. [2022-12-06 04:29:50,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14425 conditions, 4857 events. 3338/4857 cut-off events. For 3605/3650 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23797 event pairs, 1820 based on Foata normal form. 12/4866 useless extension candidates. Maximal degree in co-relation 14408. Up to 4583 conditions per place. [2022-12-06 04:29:50,342 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 46 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-06 04:29:50,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 319 flow [2022-12-06 04:29:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:29:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:29:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:29:50,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 04:29:50,345 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 150 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:29:50,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 319 flow [2022-12-06 04:29:50,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:50,349 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 174 flow [2022-12-06 04:29:50,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-06 04:29:50,350 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-06 04:29:50,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:50,351 INFO L89 Accepts]: Start accepts. Operand has 47 places, 37 transitions, 174 flow [2022-12-06 04:29:50,352 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:50,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:50,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 174 flow [2022-12-06 04:29:50,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 174 flow [2022-12-06 04:29:50,424 INFO L130 PetriNetUnfolder]: 344/749 cut-off events. [2022-12-06 04:29:50,424 INFO L131 PetriNetUnfolder]: For 1173/1263 co-relation queries the response was YES. [2022-12-06 04:29:50,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 749 events. 344/749 cut-off events. For 1173/1263 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 4952 event pairs, 178 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 1830. Up to 416 conditions per place. [2022-12-06 04:29:50,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 174 flow [2022-12-06 04:29:50,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 04:29:50,452 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:50,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 04:29:50,454 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 174 flow [2022-12-06 04:29:50,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:29:50,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:50,454 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 04:29:50,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:29:50,455 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash -602684567, now seen corresponding path program 1 times [2022-12-06 04:29:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:50,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784487821] [2022-12-06 04:29:50,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:50,644 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 04:29:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:50,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784487821] [2022-12-06 04:29:50,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784487821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:50,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:50,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367536561] [2022-12-06 04:29:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:50,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:29:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:29:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:29:50,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:29:50,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 174 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 04:29:50,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:50,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:29:50,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:50,989 INFO L130 PetriNetUnfolder]: 1785/2749 cut-off events. [2022-12-06 04:29:50,989 INFO L131 PetriNetUnfolder]: For 2479/2544 co-relation queries the response was YES. [2022-12-06 04:29:50,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8307 conditions, 2749 events. 1785/2749 cut-off events. For 2479/2544 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13789 event pairs, 320 based on Foata normal form. 203/2883 useless extension candidates. Maximal degree in co-relation 8288. Up to 1451 conditions per place. [2022-12-06 04:29:51,001 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 52 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-06 04:29:51,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 405 flow [2022-12-06 04:29:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:29:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:29:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:29:51,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 04:29:51,004 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 174 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:29:51,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 405 flow [2022-12-06 04:29:51,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:29:51,009 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 221 flow [2022-12-06 04:29:51,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-06 04:29:51,009 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-06 04:29:51,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:51,010 INFO L89 Accepts]: Start accepts. Operand has 50 places, 41 transitions, 221 flow [2022-12-06 04:29:51,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:51,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:51,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 221 flow [2022-12-06 04:29:51,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 221 flow [2022-12-06 04:29:51,061 INFO L130 PetriNetUnfolder]: 198/499 cut-off events. [2022-12-06 04:29:51,061 INFO L131 PetriNetUnfolder]: For 825/1016 co-relation queries the response was YES. [2022-12-06 04:29:51,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 499 events. 198/499 cut-off events. For 825/1016 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3001 event pairs, 61 based on Foata normal form. 18/487 useless extension candidates. Maximal degree in co-relation 1512. Up to 269 conditions per place. [2022-12-06 04:29:51,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 221 flow [2022-12-06 04:29:51,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 04:29:51,109 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:51,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 04:29:51,110 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 221 flow [2022-12-06 04:29:51,110 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 04:29:51,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:51,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:51,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:29:51,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:51,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1677166372, now seen corresponding path program 1 times [2022-12-06 04:29:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:51,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341815451] [2022-12-06 04:29:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:51,324 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 04:29:51,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341815451] [2022-12-06 04:29:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341815451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:51,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:51,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:29:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258958676] [2022-12-06 04:29:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:51,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:29:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:51,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:29:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:29:51,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:29:51,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 04:29:51,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:51,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:29:51,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:51,606 INFO L130 PetriNetUnfolder]: 1250/1936 cut-off events. [2022-12-06 04:29:51,607 INFO L131 PetriNetUnfolder]: For 2130/2161 co-relation queries the response was YES. [2022-12-06 04:29:51,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6544 conditions, 1936 events. 1250/1936 cut-off events. For 2130/2161 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9273 event pairs, 244 based on Foata normal form. 111/1994 useless extension candidates. Maximal degree in co-relation 6523. Up to 747 conditions per place. [2022-12-06 04:29:51,615 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 62 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2022-12-06 04:29:51,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 520 flow [2022-12-06 04:29:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:29:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:29:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 04:29:51,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.624 [2022-12-06 04:29:51,617 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 221 flow. Second operand 5 states and 78 transitions. [2022-12-06 04:29:51,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 520 flow [2022-12-06 04:29:51,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 502 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:29:51,620 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 271 flow [2022-12-06 04:29:51,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 04:29:51,621 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 04:29:51,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:51,621 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 271 flow [2022-12-06 04:29:51,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:51,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:51,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 271 flow [2022-12-06 04:29:51,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 271 flow [2022-12-06 04:29:51,650 INFO L130 PetriNetUnfolder]: 115/299 cut-off events. [2022-12-06 04:29:51,650 INFO L131 PetriNetUnfolder]: For 493/627 co-relation queries the response was YES. [2022-12-06 04:29:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 299 events. 115/299 cut-off events. For 493/627 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1486 event pairs, 17 based on Foata normal form. 24/303 useless extension candidates. Maximal degree in co-relation 970. Up to 145 conditions per place. [2022-12-06 04:29:51,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 271 flow [2022-12-06 04:29:51,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 04:29:51,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:29:51,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 04:29:51,656 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 271 flow [2022-12-06 04:29:51,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 04:29:51,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:51,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:51,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:29:51,656 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 838609369, now seen corresponding path program 1 times [2022-12-06 04:29:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:51,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544792340] [2022-12-06 04:29:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:51,875 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 04:29:51,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:51,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544792340] [2022-12-06 04:29:51,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544792340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:51,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:51,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167670596] [2022-12-06 04:29:51,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:51,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:29:51,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:51,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:29:51,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:29:51,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:29:51,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 04:29:51,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:51,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:29:51,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:52,275 INFO L130 PetriNetUnfolder]: 1848/2938 cut-off events. [2022-12-06 04:29:52,276 INFO L131 PetriNetUnfolder]: For 5085/5107 co-relation queries the response was YES. [2022-12-06 04:29:52,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10341 conditions, 2938 events. 1848/2938 cut-off events. For 5085/5107 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15548 event pairs, 337 based on Foata normal form. 14/2899 useless extension candidates. Maximal degree in co-relation 10319. Up to 1004 conditions per place. [2022-12-06 04:29:52,285 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 51 selfloop transitions, 3 changer transitions 75/132 dead transitions. [2022-12-06 04:29:52,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 132 transitions, 1076 flow [2022-12-06 04:29:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:29:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:29:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 04:29:52,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 04:29:52,286 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 271 flow. Second operand 5 states and 70 transitions. [2022-12-06 04:29:52,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 132 transitions, 1076 flow [2022-12-06 04:29:52,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 132 transitions, 946 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-12-06 04:29:52,297 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 250 flow [2022-12-06 04:29:52,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-06 04:29:52,298 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-06 04:29:52,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:52,298 INFO L89 Accepts]: Start accepts. Operand has 56 places, 45 transitions, 250 flow [2022-12-06 04:29:52,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:52,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:52,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 250 flow [2022-12-06 04:29:52,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 250 flow [2022-12-06 04:29:52,325 INFO L130 PetriNetUnfolder]: 124/318 cut-off events. [2022-12-06 04:29:52,326 INFO L131 PetriNetUnfolder]: For 436/485 co-relation queries the response was YES. [2022-12-06 04:29:52,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 318 events. 124/318 cut-off events. For 436/485 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1621 event pairs, 18 based on Foata normal form. 27/325 useless extension candidates. Maximal degree in co-relation 887. Up to 112 conditions per place. [2022-12-06 04:29:52,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 250 flow [2022-12-06 04:29:52,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-06 04:29:52,330 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] $Ultimate##0-->L836: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_43 2) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~y~0=v_~y~0_43, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, ~y~0, P3Thread1of1ForFork2_~arg.base] and [821] $Ultimate##0-->L764: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_77 v_~__unbuffered_p0_EAX~0_59)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_77} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_77, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:29:52,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:29:52,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:29:52,359 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 253 flow [2022-12-06 04:29:52,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 04:29:52,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:52,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:52,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:29:52,359 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1038556537, now seen corresponding path program 2 times [2022-12-06 04:29:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:52,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766607254] [2022-12-06 04:29:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:52,560 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 04:29:52,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:52,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766607254] [2022-12-06 04:29:52,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766607254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:52,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:52,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:29:52,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896797846] [2022-12-06 04:29:52,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:52,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:29:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:29:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:29:52,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 04:29:52,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 04:29:52,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:52,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 04:29:52,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:52,765 INFO L130 PetriNetUnfolder]: 751/1188 cut-off events. [2022-12-06 04:29:52,765 INFO L131 PetriNetUnfolder]: For 1278/1297 co-relation queries the response was YES. [2022-12-06 04:29:52,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3940 conditions, 1188 events. 751/1188 cut-off events. For 1278/1297 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5378 event pairs, 132 based on Foata normal form. 24/1189 useless extension candidates. Maximal degree in co-relation 3917. Up to 469 conditions per place. [2022-12-06 04:29:52,799 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 51 selfloop transitions, 17 changer transitions 5/77 dead transitions. [2022-12-06 04:29:52,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 527 flow [2022-12-06 04:29:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:29:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:29:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 04:29:52,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5064102564102564 [2022-12-06 04:29:52,801 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 253 flow. Second operand 6 states and 79 transitions. [2022-12-06 04:29:52,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 527 flow [2022-12-06 04:29:52,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 489 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 04:29:52,807 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 260 flow [2022-12-06 04:29:52,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-06 04:29:52,808 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-06 04:29:52,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:52,808 INFO L89 Accepts]: Start accepts. Operand has 55 places, 43 transitions, 260 flow [2022-12-06 04:29:52,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:52,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:52,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 43 transitions, 260 flow [2022-12-06 04:29:52,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 260 flow [2022-12-06 04:29:52,820 INFO L130 PetriNetUnfolder]: 51/126 cut-off events. [2022-12-06 04:29:52,820 INFO L131 PetriNetUnfolder]: For 152/159 co-relation queries the response was YES. [2022-12-06 04:29:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 126 events. 51/126 cut-off events. For 152/159 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 416 event pairs, 6 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 398. Up to 40 conditions per place. [2022-12-06 04:29:52,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 260 flow [2022-12-06 04:29:52,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 04:29:57,193 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:29:57,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4386 [2022-12-06 04:29:57,194 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 259 flow [2022-12-06 04:29:57,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 04:29:57,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:57,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:57,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:29:57,194 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1581382117, now seen corresponding path program 1 times [2022-12-06 04:29:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:57,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892285525] [2022-12-06 04:29:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:29:57,887 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 04:29:57,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:29:57,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892285525] [2022-12-06 04:29:57,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892285525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:29:57,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:29:57,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:29:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192695546] [2022-12-06 04:29:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:29:57,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:29:57,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:29:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:29:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:29:57,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:29:57,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 259 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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 04:29:57,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:29:57,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:29:57,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:29:58,096 INFO L130 PetriNetUnfolder]: 543/862 cut-off events. [2022-12-06 04:29:58,098 INFO L131 PetriNetUnfolder]: For 1733/1733 co-relation queries the response was YES. [2022-12-06 04:29:58,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 862 events. 543/862 cut-off events. For 1733/1733 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3388 event pairs, 148 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 3199. Up to 459 conditions per place. [2022-12-06 04:29:58,103 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 47 selfloop transitions, 9 changer transitions 17/73 dead transitions. [2022-12-06 04:29:58,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 640 flow [2022-12-06 04:29:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:29:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:29:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 04:29:58,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 04:29:58,105 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 259 flow. Second operand 5 states and 42 transitions. [2022-12-06 04:29:58,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 640 flow [2022-12-06 04:29:58,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 523 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-06 04:29:58,112 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 241 flow [2022-12-06 04:29:58,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2022-12-06 04:29:58,113 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 04:29:58,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:29:58,113 INFO L89 Accepts]: Start accepts. Operand has 51 places, 40 transitions, 241 flow [2022-12-06 04:29:58,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:29:58,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:29:58,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 241 flow [2022-12-06 04:29:58,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 241 flow [2022-12-06 04:29:58,132 INFO L130 PetriNetUnfolder]: 76/165 cut-off events. [2022-12-06 04:29:58,132 INFO L131 PetriNetUnfolder]: For 171/177 co-relation queries the response was YES. [2022-12-06 04:29:58,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 165 events. 76/165 cut-off events. For 171/177 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 671 event pairs, 1 based on Foata normal form. 4/162 useless extension candidates. Maximal degree in co-relation 498. Up to 56 conditions per place. [2022-12-06 04:29:58,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 241 flow [2022-12-06 04:29:58,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 04:29:59,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:29:59,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1520 [2022-12-06 04:29:59,633 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 245 flow [2022-12-06 04:29:59,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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 04:29:59,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:29:59,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:59,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:29:59,633 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:29:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:29:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1685083278, now seen corresponding path program 1 times [2022-12-06 04:29:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:29:59,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251368532] [2022-12-06 04:29:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:29:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:29:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:29:59,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:29:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:29:59,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:29:59,988 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:29:59,990 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:29:59,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 04:29:59,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:29:59,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:29:59,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 04:29:59,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:29:59,992 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:29:59,996 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:29:59,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:30:00,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:30:00 BasicIcfg [2022-12-06 04:30:00,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:30:00,167 INFO L158 Benchmark]: Toolchain (without parser) took 29325.42ms. Allocated memory was 194.0MB in the beginning and 1.2GB in the end (delta: 962.6MB). Free memory was 169.2MB in the beginning and 959.5MB in the end (delta: -790.3MB). Peak memory consumption was 173.2MB. Max. memory is 8.0GB. [2022-12-06 04:30:00,167 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 170.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:30:00,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.83ms. Allocated memory is still 194.0MB. Free memory was 168.8MB in the beginning and 139.9MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:30:00,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.23ms. Allocated memory is still 194.0MB. Free memory was 139.9MB in the beginning and 137.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:00,167 INFO L158 Benchmark]: Boogie Preprocessor took 53.52ms. Allocated memory is still 194.0MB. Free memory was 137.4MB in the beginning and 134.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:30:00,168 INFO L158 Benchmark]: RCFGBuilder took 908.42ms. Allocated memory is still 194.0MB. Free memory was 134.6MB in the beginning and 99.9MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 04:30:00,168 INFO L158 Benchmark]: TraceAbstraction took 27779.82ms. Allocated memory was 194.0MB in the beginning and 1.2GB in the end (delta: 962.6MB). Free memory was 98.8MB in the beginning and 959.5MB in the end (delta: -860.7MB). Peak memory consumption was 101.8MB. Max. memory is 8.0GB. [2022-12-06 04:30:00,170 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.10ms. Allocated memory is still 194.0MB. Free memory is still 170.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 515.83ms. Allocated memory is still 194.0MB. Free memory was 168.8MB in the beginning and 139.9MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.23ms. Allocated memory is still 194.0MB. Free memory was 139.9MB in the beginning and 137.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.52ms. Allocated memory is still 194.0MB. Free memory was 137.4MB in the beginning and 134.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 908.42ms. Allocated memory is still 194.0MB. Free memory was 134.6MB in the beginning and 99.9MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 27779.82ms. Allocated memory was 194.0MB in the beginning and 1.2GB in the end (delta: 962.6MB). Free memory was 98.8MB in the beginning and 959.5MB in the end (delta: -860.7MB). Peak memory consumption was 101.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 138 PlacesBefore, 38 PlacesAfterwards, 126 TransitionsBefore, 26 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1318, independent: 1234, independent conditional: 1234, independent unconditional: 0, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1318, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1318, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1318, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1089, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1089, independent: 1011, independent conditional: 0, independent unconditional: 1011, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 487, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 450, dependent conditional: 0, dependent unconditional: 450, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1318, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 1089, unknown conditional: 0, unknown unconditional: 1089] , Statistics on independence cache: Total cache size (in pairs): 1509, Positive cache size: 1462, Positive conditional cache size: 0, Positive unconditional cache size: 1462, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, 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, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 87, unknown conditional: 0, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 57, independent conditional: 57, 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: 79, independent: 57, independent conditional: 14, independent unconditional: 43, 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: 79, independent: 57, independent conditional: 0, independent unconditional: 57, 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: 79, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 68, independent conditional: 68, 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: 90, independent: 68, independent conditional: 29, independent unconditional: 39, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 68, independent conditional: 0, independent unconditional: 68, 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: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 46, independent conditional: 27, independent unconditional: 19, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, 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.0s, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 46, independent conditional: 24, independent unconditional: 22, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 48, independent conditional: 35, independent unconditional: 13, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 48, independent conditional: 9, independent unconditional: 39, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 9, independent unconditional: 39, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 45, independent conditional: 7, independent unconditional: 38, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 72, Positive conditional cache size: 2, Positive unconditional cache size: 70, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 36, independent conditional: 30, independent unconditional: 6, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 36, independent conditional: 9, independent unconditional: 27, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 36, independent conditional: 9, independent unconditional: 27, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 34, independent conditional: 9, independent unconditional: 25, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 74, Positive conditional cache size: 2, Positive unconditional cache size: 72, Negative cache size: 43, Negative conditional cache size: 3, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 85, independent: 72, independent conditional: 44, independent unconditional: 28, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 72, independent conditional: 12, independent unconditional: 60, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 12, independent unconditional: 60, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 66, independent conditional: 12, independent unconditional: 54, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 80, Positive conditional cache size: 2, Positive unconditional cache size: 78, Negative cache size: 45, Negative conditional cache size: 4, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 71, independent conditional: 62, independent unconditional: 9, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 71, independent conditional: 22, independent unconditional: 49, dependent: 20, dependent conditional: 6, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 71, independent conditional: 22, independent unconditional: 49, dependent: 20, dependent conditional: 6, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 71, independent conditional: 22, independent unconditional: 49, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 80, Positive conditional cache size: 2, Positive unconditional cache size: 78, Negative cache size: 46, Negative conditional cache size: 4, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 66, independent conditional: 66, 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: 83, independent: 66, independent conditional: 64, independent unconditional: 2, dependent: 17, dependent conditional: 5, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 66, independent conditional: 30, independent unconditional: 36, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 66, independent conditional: 30, independent unconditional: 36, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 66, independent conditional: 30, independent unconditional: 36, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 80, Positive conditional cache size: 2, Positive unconditional cache size: 78, Negative cache size: 46, Negative conditional cache size: 4, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 28, dependent conditional: 2, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 51, independent conditional: 45, independent unconditional: 6, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 51, independent conditional: 45, independent unconditional: 6, dependent: 30, dependent conditional: 4, dependent unconditional: 26, 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: 81, independent: 51, independent conditional: 45, independent unconditional: 6, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 82, Positive conditional cache size: 2, Positive unconditional cache size: 80, Negative cache size: 46, Negative conditional cache size: 4, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 55 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 39 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 169, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174, independent: 140, independent conditional: 125, independent unconditional: 15, dependent: 34, dependent conditional: 6, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174, independent: 140, independent conditional: 125, independent unconditional: 15, dependent: 34, dependent conditional: 6, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 7, independent unconditional: 6, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 11, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 174, independent: 127, independent conditional: 118, independent unconditional: 9, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 17, unknown conditional: 9, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 112, Positive conditional cache size: 9, Positive unconditional cache size: 103, Negative cache size: 50, Negative conditional cache size: 6, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 114, Positive conditional cache size: 11, Positive unconditional cache size: 103, Negative cache size: 50, Negative conditional cache size: 6, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2165; [L861] FCALL, FORK 0 pthread_create(&t2165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2165, ((void *)0), P0, ((void *)0))=-3, t2165={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L862] 0 pthread_t t2166; [L863] FCALL, FORK 0 pthread_create(&t2166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2166, ((void *)0), P1, ((void *)0))=-2, t2165={7:0}, t2166={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L864] 0 pthread_t t2167; [L865] FCALL, FORK 0 pthread_create(&t2167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2167, ((void *)0), P2, ((void *)0))=-1, t2165={7:0}, t2166={8:0}, t2167={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L866] 0 pthread_t t2168; [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] EXPR 3 \read(x) [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L805] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L806] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L807] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L808] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L810] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L812] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L813] EXPR 3 \read(x) [L813] 3 __unbuffered_p2_EAX = x [L814] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L814] EXPR 3 \read(x) [L814] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L814] 3 x = x$flush_delayed ? x$mem_tmp : x [L815] 3 x$flush_delayed = (_Bool)0 [L818] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L867] FCALL, FORK 0 pthread_create(&t2168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2168, ((void *)0), P3, ((void *)0))=0, t2165={7:0}, t2166={8:0}, t2167={9:0}, t2168={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L835] 4 y = 2 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L838] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L838] EXPR 4 \read(x) [L838] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L838] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L840] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L841] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L842] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L821] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L821] EXPR 3 \read(x) [L821] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L821] 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) [L822] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L823] 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 [L824] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L825] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L763] 1 __unbuffered_p0_EAX = y [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0: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=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L783] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0: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=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 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_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0: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=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 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) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 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 [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0: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=3, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L873] EXPR 0 \read(x) [L873] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] 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) [L874] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L875] 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 [L876] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L877] 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 [L880] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L881] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L882] 0 x$flush_delayed = weak$$choice2 [L883] EXPR 0 \read(x) [L883] 0 x$mem_tmp = x [L884] EXPR 0 !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) [L884] EXPR 0 \read(x) [L884] EXPR 0 !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) [L884] 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) [L885] 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)) [L886] 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)) [L887] 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)) [L888] 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)) [L889] 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)) [L890] 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)) [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 \read(x) [L893] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L894] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L894] 0 x = x$flush_delayed ? x$mem_tmp : x [L895] 0 x$flush_delayed = (_Bool)0 [L897] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] - UnprovableResult [Line: 865]: 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: 861]: 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: 867]: 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: 863]: 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 9 procedures, 177 locations, 5 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: 27.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 841 IncrementalHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 3 mSDtfsCounter, 841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=10, InterpolantAutomatonStates: 49, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 04:30:00,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...