/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:18:39,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:18:39,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:18:39,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:18:39,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:18:39,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:18:39,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:18:39,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:18:39,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:18:39,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:18:39,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:18:39,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:18:39,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:18:39,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:18:39,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:18:39,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:18:39,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:18:39,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:18:39,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:18:39,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:18:39,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:18:39,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:18:39,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:18:39,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:18:39,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:18:39,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:18:39,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:18:39,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:18:39,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:18:39,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:18:39,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:18:39,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:18:39,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:18:39,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:18:39,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:18:39,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:18:39,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:18:39,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:18:39,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:18:39,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:18:39,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:18:39,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:18:39,832 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:18:39,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:18:39,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:18:39,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:18:39,839 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:18:39,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:18:39,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:18:39,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:18:39,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:18:39,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:18:39,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:18:39,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:18:39,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:18:39,841 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:18:39,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:18:39,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:18:39,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:18:39,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:18:39,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:18:39,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:18:39,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:18:39,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:39,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:18:39,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:18:39,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:18:39,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:18:39,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:18:39,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:18:39,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:18:40,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:18:40,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:18:40,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:18:40,381 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:18:40,387 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:18:40,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2022-12-06 06:18:42,039 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:18:42,474 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:18:42,474 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2022-12-06 06:18:42,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/745f20502/1b0864f4b4b64bbdaa7428b39ac1cc25/FLAGa9ade15ff [2022-12-06 06:18:42,554 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/745f20502/1b0864f4b4b64bbdaa7428b39ac1cc25 [2022-12-06 06:18:42,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:18:42,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:18:42,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:42,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:18:42,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:18:42,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:42" (1/1) ... [2022-12-06 06:18:42,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3005039c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:42, skipping insertion in model container [2022-12-06 06:18:42,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:42" (1/1) ... [2022-12-06 06:18:42,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:18:42,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:18:42,890 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/mix014_tso.oepc.i[949,962] [2022-12-06 06:18:43,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:43,205 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:18:43,216 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/mix014_tso.oepc.i[949,962] [2022-12-06 06:18:43,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:43,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:43,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:43,373 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:18:43,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43 WrapperNode [2022-12-06 06:18:43,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:43,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:43,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:18:43,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:18:43,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,423 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 257 [2022-12-06 06:18:43,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:43,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:18:43,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:18:43,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:18:43,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,464 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:18:43,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:18:43,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:18:43,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:18:43,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (1/1) ... [2022-12-06 06:18:43,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:43,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:18:43,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:18:43,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:18:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:18:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:18:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:18:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:18:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:18:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:18:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:18:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:18:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:18:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:18:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:18:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:18:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:18:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:18:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:18:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:18:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:18:43,599 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:18:43,868 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:18:43,869 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:18:44,374 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:18:44,644 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:18:44,644 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:18:44,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:44 BoogieIcfgContainer [2022-12-06 06:18:44,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:18:44,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:18:44,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:18:44,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:18:44,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:18:42" (1/3) ... [2022-12-06 06:18:44,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80520f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:44, skipping insertion in model container [2022-12-06 06:18:44,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:43" (2/3) ... [2022-12-06 06:18:44,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80520f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:44, skipping insertion in model container [2022-12-06 06:18:44,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:44" (3/3) ... [2022-12-06 06:18:44,679 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2022-12-06 06:18:44,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:18:44,693 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 06:18:44,693 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:18:44,834 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:18:44,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-12-06 06:18:44,978 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-06 06:18:44,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:45,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 06:18:45,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-12-06 06:18:45,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-12-06 06:18:45,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:45,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-06 06:18:45,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-12-06 06:18:45,195 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-06 06:18:45,195 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:45,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 06:18:45,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-06 06:18:45,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 3408 [2022-12-06 06:18:52,771 INFO L203 LiptonReduction]: Total number of compositions: 116 [2022-12-06 06:18:52,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:18:52,792 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;@5ddd2e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:18:52,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-06 06:18:52,795 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:18:52,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:52,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:52,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:18:52,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:18:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash 713496055, now seen corresponding path program 1 times [2022-12-06 06:18:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:52,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853577987] [2022-12-06 06:18:52,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:53,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853577987] [2022-12-06 06:18:53,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853577987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:53,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:53,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:53,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144646481] [2022-12-06 06:18:53,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:53,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:53,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:53,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:53,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 06:18:53,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 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 06:18:53,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:53,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 06:18:53,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:54,976 INFO L130 PetriNetUnfolder]: 9523/12945 cut-off events. [2022-12-06 06:18:54,976 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-06 06:18:55,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26093 conditions, 12945 events. 9523/12945 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 68672 event pairs, 3053 based on Foata normal form. 0/11072 useless extension candidates. Maximal degree in co-relation 26081. Up to 11151 conditions per place. [2022-12-06 06:18:55,054 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 47 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2022-12-06 06:18:55,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 230 flow [2022-12-06 06:18:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 06:18:55,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-06 06:18:55,065 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 68 transitions. [2022-12-06 06:18:55,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 230 flow [2022-12-06 06:18:55,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:18:55,070 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 78 flow [2022-12-06 06:18:55,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-06 06:18:55,074 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-06 06:18:55,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:55,075 INFO L89 Accepts]: Start accepts. Operand has 45 places, 33 transitions, 78 flow [2022-12-06 06:18:55,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:55,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:55,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 78 flow [2022-12-06 06:18:55,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 78 flow [2022-12-06 06:18:55,088 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-06 06:18:55,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:55,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:18:55,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 78 flow [2022-12-06 06:18:55,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-06 06:18:55,184 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:55,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 06:18:55,186 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 78 flow [2022-12-06 06:18:55,186 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 06:18:55,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:55,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:55,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:18:55,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:18:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1525013903, now seen corresponding path program 1 times [2022-12-06 06:18:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:55,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752951638] [2022-12-06 06:18:55,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:55,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:55,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752951638] [2022-12-06 06:18:55,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752951638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:55,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:55,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572963039] [2022-12-06 06:18:55,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:55,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:55,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:55,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:55,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 06:18:55,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 78 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 06:18:55,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:55,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 06:18:55,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:56,820 INFO L130 PetriNetUnfolder]: 7475/10917 cut-off events. [2022-12-06 06:18:56,820 INFO L131 PetriNetUnfolder]: For 437/437 co-relation queries the response was YES. [2022-12-06 06:18:56,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21735 conditions, 10917 events. 7475/10917 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 65721 event pairs, 1445 based on Foata normal form. 0/9956 useless extension candidates. Maximal degree in co-relation 21725. Up to 7975 conditions per place. [2022-12-06 06:18:56,861 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 39 selfloop transitions, 2 changer transitions 6/51 dead transitions. [2022-12-06 06:18:56,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 212 flow [2022-12-06 06:18:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 06:18:56,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 06:18:56,863 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 78 flow. Second operand 3 states and 60 transitions. [2022-12-06 06:18:56,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 212 flow [2022-12-06 06:18:56,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:56,865 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2022-12-06 06:18:56,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-06 06:18:56,865 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2022-12-06 06:18:56,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:56,866 INFO L89 Accepts]: Start accepts. Operand has 43 places, 29 transitions, 70 flow [2022-12-06 06:18:56,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:56,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:56,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 29 transitions, 70 flow [2022-12-06 06:18:56,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2022-12-06 06:18:56,873 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 06:18:56,873 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:56,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:18:56,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2022-12-06 06:18:56,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 06:18:56,900 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:56,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 06:18:56,901 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-06 06:18:56,901 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 06:18:56,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:56,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:56,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:18:56,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:18:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1899546857, now seen corresponding path program 1 times [2022-12-06 06:18:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:56,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977680690] [2022-12-06 06:18:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:57,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977680690] [2022-12-06 06:18:57,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977680690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:57,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:57,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016240640] [2022-12-06 06:18:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:57,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:57,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:18:57,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:57,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:57,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:18:57,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:58,694 INFO L130 PetriNetUnfolder]: 10667/14338 cut-off events. [2022-12-06 06:18:58,695 INFO L131 PetriNetUnfolder]: For 710/710 co-relation queries the response was YES. [2022-12-06 06:18:58,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29772 conditions, 14338 events. 10667/14338 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 65314 event pairs, 3627 based on Foata normal form. 300/14638 useless extension candidates. Maximal degree in co-relation 29762. Up to 9891 conditions per place. [2022-12-06 06:18:58,738 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 42 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-12-06 06:18:58,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 190 flow [2022-12-06 06:18:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:18:58,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-06 06:18:58,740 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:18:58,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 190 flow [2022-12-06 06:18:58,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:58,743 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 74 flow [2022-12-06 06:18:58,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-06 06:18:58,744 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2022-12-06 06:18:58,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:58,745 INFO L89 Accepts]: Start accepts. Operand has 41 places, 29 transitions, 74 flow [2022-12-06 06:18:58,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:58,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:58,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 74 flow [2022-12-06 06:18:58,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 74 flow [2022-12-06 06:18:58,750 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 06:18:58,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:58,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:18:58,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 74 flow [2022-12-06 06:18:58,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 06:18:58,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:58,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 06:18:58,801 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2022-12-06 06:18:58,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:58,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:58,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:58,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:18:58,801 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:18:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1243559183, now seen corresponding path program 1 times [2022-12-06 06:18:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:58,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130401885] [2022-12-06 06:18:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:58,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:58,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130401885] [2022-12-06 06:18:58,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130401885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:58,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:58,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644430684] [2022-12-06 06:18:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:58,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:58,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:58,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:58,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:18:58,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 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 06:18:58,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:58,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:18:58,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:59,639 INFO L130 PetriNetUnfolder]: 4259/5909 cut-off events. [2022-12-06 06:18:59,640 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2022-12-06 06:18:59,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12784 conditions, 5909 events. 4259/5909 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 29935 event pairs, 1227 based on Foata normal form. 96/5956 useless extension candidates. Maximal degree in co-relation 12773. Up to 4297 conditions per place. [2022-12-06 06:18:59,667 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 38 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-06 06:18:59,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 189 flow [2022-12-06 06:18:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:18:59,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-06 06:18:59,669 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:18:59,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 189 flow [2022-12-06 06:18:59,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:59,671 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 76 flow [2022-12-06 06:18:59,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-06 06:18:59,673 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2022-12-06 06:18:59,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:59,673 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 76 flow [2022-12-06 06:18:59,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:59,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:59,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 76 flow [2022-12-06 06:18:59,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 76 flow [2022-12-06 06:18:59,681 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:18:59,681 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:18:59,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 28 events. 0/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:18:59,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 76 flow [2022-12-06 06:18:59,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 06:18:59,684 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:59,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:18:59,691 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 76 flow [2022-12-06 06:18:59,691 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 06:18:59,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:59,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:59,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:18:59,691 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:18:59,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1018667504, now seen corresponding path program 1 times [2022-12-06 06:18:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:59,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27915058] [2022-12-06 06:18:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:59,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27915058] [2022-12-06 06:18:59,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27915058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:59,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:59,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399713528] [2022-12-06 06:18:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:59,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:59,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:18:59,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:59,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:59,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:18:59,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:00,559 INFO L130 PetriNetUnfolder]: 2963/4287 cut-off events. [2022-12-06 06:19:00,560 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-12-06 06:19:00,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9605 conditions, 4287 events. 2963/4287 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21328 event pairs, 778 based on Foata normal form. 135/4399 useless extension candidates. Maximal degree in co-relation 9593. Up to 3487 conditions per place. [2022-12-06 06:19:00,587 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 40 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2022-12-06 06:19:00,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 216 flow [2022-12-06 06:19:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:19:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:19:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 06:19:00,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-06 06:19:00,591 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 76 flow. Second operand 3 states and 55 transitions. [2022-12-06 06:19:00,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 216 flow [2022-12-06 06:19:00,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:00,599 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 105 flow [2022-12-06 06:19:00,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-06 06:19:00,601 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-06 06:19:00,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:00,602 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 105 flow [2022-12-06 06:19:00,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:00,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:00,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 105 flow [2022-12-06 06:19:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 105 flow [2022-12-06 06:19:00,619 INFO L130 PetriNetUnfolder]: 45/126 cut-off events. [2022-12-06 06:19:00,619 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 06:19:00,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 126 events. 45/126 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 23 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 241. Up to 76 conditions per place. [2022-12-06 06:19:00,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 105 flow [2022-12-06 06:19:00,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-06 06:19:00,623 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:00,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:19:00,624 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 105 flow [2022-12-06 06:19:00,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:00,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:00,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:00,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:19:00,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:19:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2145632999, now seen corresponding path program 1 times [2022-12-06 06:19:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:00,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171484794] [2022-12-06 06:19:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:00,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171484794] [2022-12-06 06:19:00,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171484794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:00,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:00,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913941030] [2022-12-06 06:19:00,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:00,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:00,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:00,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:00,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:19:00,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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 06:19:00,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:00,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:19:00,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:01,265 INFO L130 PetriNetUnfolder]: 1748/2667 cut-off events. [2022-12-06 06:19:01,265 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2022-12-06 06:19:01,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6870 conditions, 2667 events. 1748/2667 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13040 event pairs, 530 based on Foata normal form. 162/2806 useless extension candidates. Maximal degree in co-relation 6857. Up to 1047 conditions per place. [2022-12-06 06:19:01,275 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 54 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-06 06:19:01,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 321 flow [2022-12-06 06:19:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 06:19:01,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2022-12-06 06:19:01,277 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 105 flow. Second operand 4 states and 76 transitions. [2022-12-06 06:19:01,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 321 flow [2022-12-06 06:19:01,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:19:01,278 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 152 flow [2022-12-06 06:19:01,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-06 06:19:01,279 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-06 06:19:01,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:01,279 INFO L89 Accepts]: Start accepts. Operand has 45 places, 36 transitions, 152 flow [2022-12-06 06:19:01,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:01,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:01,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 152 flow [2022-12-06 06:19:01,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 152 flow [2022-12-06 06:19:01,290 INFO L130 PetriNetUnfolder]: 33/102 cut-off events. [2022-12-06 06:19:01,290 INFO L131 PetriNetUnfolder]: For 28/40 co-relation queries the response was YES. [2022-12-06 06:19:01,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 102 events. 33/102 cut-off events. For 28/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 333 event pairs, 7 based on Foata normal form. 4/104 useless extension candidates. Maximal degree in co-relation 260. Up to 60 conditions per place. [2022-12-06 06:19:01,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 152 flow [2022-12-06 06:19:01,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 584 [2022-12-06 06:19:01,404 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:01,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 06:19:01,404 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 152 flow [2022-12-06 06:19:01,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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 06:19:01,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:01,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:01,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:19:01,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:19:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash 306004101, now seen corresponding path program 1 times [2022-12-06 06:19:01,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:01,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694823750] [2022-12-06 06:19:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:01,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:01,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694823750] [2022-12-06 06:19:01,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694823750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:01,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:01,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027903181] [2022-12-06 06:19:01,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:01,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:01,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:01,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:01,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:19:01,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:01,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:01,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:19:01,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:02,010 INFO L130 PetriNetUnfolder]: 1370/2100 cut-off events. [2022-12-06 06:19:02,010 INFO L131 PetriNetUnfolder]: For 1322/1322 co-relation queries the response was YES. [2022-12-06 06:19:02,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5882 conditions, 2100 events. 1370/2100 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10030 event pairs, 487 based on Foata normal form. 72/2149 useless extension candidates. Maximal degree in co-relation 5867. Up to 820 conditions per place. [2022-12-06 06:19:02,021 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 66 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2022-12-06 06:19:02,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 436 flow [2022-12-06 06:19:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:19:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:19:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 06:19:02,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2022-12-06 06:19:02,023 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 152 flow. Second operand 5 states and 95 transitions. [2022-12-06 06:19:02,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 436 flow [2022-12-06 06:19:02,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 418 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:02,027 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 202 flow [2022-12-06 06:19:02,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-06 06:19:02,028 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2022-12-06 06:19:02,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:02,028 INFO L89 Accepts]: Start accepts. Operand has 48 places, 40 transitions, 202 flow [2022-12-06 06:19:02,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:02,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:02,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 202 flow [2022-12-06 06:19:02,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 202 flow [2022-12-06 06:19:02,041 INFO L130 PetriNetUnfolder]: 21/72 cut-off events. [2022-12-06 06:19:02,042 INFO L131 PetriNetUnfolder]: For 57/69 co-relation queries the response was YES. [2022-12-06 06:19:02,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 72 events. 21/72 cut-off events. For 57/69 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 165 event pairs, 1 based on Foata normal form. 4/74 useless extension candidates. Maximal degree in co-relation 211. Up to 38 conditions per place. [2022-12-06 06:19:02,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 202 flow [2022-12-06 06:19:02,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 584 [2022-12-06 06:19:02,044 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:02,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 06:19:02,044 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 202 flow [2022-12-06 06:19:02,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:02,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:02,045 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, 1, 1] [2022-12-06 06:19:02,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:19:02,045 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:19:02,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:02,045 INFO L85 PathProgramCache]: Analyzing trace with hash 343616744, now seen corresponding path program 1 times [2022-12-06 06:19:02,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:02,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382360950] [2022-12-06 06:19:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:02,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382360950] [2022-12-06 06:19:02,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382360950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:02,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:02,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851158542] [2022-12-06 06:19:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:02,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:02,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:02,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:19:02,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:02,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:02,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:19:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:02,846 INFO L130 PetriNetUnfolder]: 2034/3223 cut-off events. [2022-12-06 06:19:02,846 INFO L131 PetriNetUnfolder]: For 3134/3134 co-relation queries the response was YES. [2022-12-06 06:19:02,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9141 conditions, 3223 events. 2034/3223 cut-off events. For 3134/3134 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17740 event pairs, 258 based on Foata normal form. 11/3230 useless extension candidates. Maximal degree in co-relation 9125. Up to 1857 conditions per place. [2022-12-06 06:19:02,890 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 65 selfloop transitions, 2 changer transitions 24/93 dead transitions. [2022-12-06 06:19:02,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 665 flow [2022-12-06 06:19:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 06:19:02,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-06 06:19:02,892 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 202 flow. Second operand 4 states and 70 transitions. [2022-12-06 06:19:02,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 665 flow [2022-12-06 06:19:02,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 575 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 06:19:02,915 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 181 flow [2022-12-06 06:19:02,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-06 06:19:02,916 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2022-12-06 06:19:02,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:02,916 INFO L89 Accepts]: Start accepts. Operand has 50 places, 41 transitions, 181 flow [2022-12-06 06:19:02,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:02,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:02,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 181 flow [2022-12-06 06:19:02,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 181 flow [2022-12-06 06:19:02,929 INFO L130 PetriNetUnfolder]: 41/121 cut-off events. [2022-12-06 06:19:02,929 INFO L131 PetriNetUnfolder]: For 109/120 co-relation queries the response was YES. [2022-12-06 06:19:02,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 121 events. 41/121 cut-off events. For 109/120 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 431 event pairs, 2 based on Foata normal form. 6/120 useless extension candidates. Maximal degree in co-relation 310. Up to 52 conditions per place. [2022-12-06 06:19:02,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 181 flow [2022-12-06 06:19:02,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-06 06:19:02,945 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:02,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 06:19:02,957 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 181 flow [2022-12-06 06:19:02,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:02,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:02,957 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, 1, 1] [2022-12-06 06:19:02,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:19:02,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:19:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 433444938, now seen corresponding path program 2 times [2022-12-06 06:19:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:02,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618458739] [2022-12-06 06:19:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:03,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618458739] [2022-12-06 06:19:03,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618458739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:03,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:03,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894284283] [2022-12-06 06:19:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:03,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:03,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:03,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:19:03,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:03,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:03,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:19:03,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:04,668 INFO L130 PetriNetUnfolder]: 3670/5526 cut-off events. [2022-12-06 06:19:04,668 INFO L131 PetriNetUnfolder]: For 3892/3892 co-relation queries the response was YES. [2022-12-06 06:19:04,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15391 conditions, 5526 events. 3670/5526 cut-off events. For 3892/3892 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 30430 event pairs, 189 based on Foata normal form. 13/5511 useless extension candidates. Maximal degree in co-relation 15374. Up to 3137 conditions per place. [2022-12-06 06:19:04,714 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 105 selfloop transitions, 18 changer transitions 8/134 dead transitions. [2022-12-06 06:19:04,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 134 transitions, 817 flow [2022-12-06 06:19:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:19:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:19:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-06 06:19:04,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2022-12-06 06:19:04,716 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 181 flow. Second operand 7 states and 109 transitions. [2022-12-06 06:19:04,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 134 transitions, 817 flow [2022-12-06 06:19:04,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 134 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:19:04,759 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 294 flow [2022-12-06 06:19:04,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=294, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2022-12-06 06:19:04,760 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2022-12-06 06:19:04,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:04,760 INFO L89 Accepts]: Start accepts. Operand has 58 places, 58 transitions, 294 flow [2022-12-06 06:19:04,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:04,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:04,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 58 transitions, 294 flow [2022-12-06 06:19:04,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 294 flow [2022-12-06 06:19:04,835 INFO L130 PetriNetUnfolder]: 391/877 cut-off events. [2022-12-06 06:19:04,835 INFO L131 PetriNetUnfolder]: For 707/886 co-relation queries the response was YES. [2022-12-06 06:19:04,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 877 events. 391/877 cut-off events. For 707/886 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5612 event pairs, 55 based on Foata normal form. 64/874 useless extension candidates. Maximal degree in co-relation 2432. Up to 260 conditions per place. [2022-12-06 06:19:04,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 58 transitions, 294 flow [2022-12-06 06:19:04,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 986 [2022-12-06 06:19:04,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] L773-->L776: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [577] L893-->L905: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff1_thd4~0_28 256) 0))) (.cse6 (not (= (mod v_~x$w_buff0_used~0_191 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd4~0_32 256) 0))) (.cse9 (not (= (mod v_~y$w_buff0_used~0_139 256) 0))) (.cse8 (not (= (mod v_~y$r_buff1_thd4~0_32 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd4~0_34 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_140 256) 0)) .cse11)) (.cse7 (and (not (= (mod v_~y$w_buff1_used~0_125 256) 0)) .cse8)) (.cse2 (and .cse9 .cse11)) (.cse3 (and (not (= (mod v_~x$w_buff0_used~0_192 256) 0)) .cse10)) (.cse0 (and .cse6 .cse10)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff1_used~0_173 256) 0))))) (and (= v_~x$r_buff0_thd4~0_31 (ite .cse0 0 v_~x$r_buff0_thd4~0_32)) (= v_~y$w_buff0_used~0_139 (ite .cse1 0 v_~y$w_buff0_used~0_140)) (= v_~y$r_buff0_thd4~0_33 (ite .cse2 0 v_~y$r_buff0_thd4~0_34)) (= (ite .cse3 v_~x$w_buff0~0_83 (ite .cse4 v_~x$w_buff1~0_76 v_~x~0_132)) v_~x~0_131) (= v_~x$r_buff1_thd4~0_27 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_172 256) 0)) .cse5) (and (not (= (mod v_~x$r_buff0_thd4~0_31 256) 0)) .cse6)) 0 v_~x$r_buff1_thd4~0_28)) (= v_~y~0_100 (ite .cse1 v_~y$w_buff0~0_74 (ite .cse7 v_~y$w_buff1~0_63 v_~y~0_101))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_124 256) 0)) .cse8) (and .cse9 (not (= (mod v_~y$r_buff0_thd4~0_33 256) 0)))) 0 v_~y$r_buff1_thd4~0_32) v_~y$r_buff1_thd4~0_31) (= (ite (or .cse7 .cse2) 0 v_~y$w_buff1_used~0_125) v_~y$w_buff1_used~0_124) (= (ite .cse3 0 v_~x$w_buff0_used~0_192) v_~x$w_buff0_used~0_191) (= v_~x$w_buff1_used~0_172 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_173))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_83, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_140, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_173, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_32, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_34, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_32, ~y$w_buff1~0=v_~y$w_buff1~0_63, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_101, ~x~0=v_~x~0_132, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_83, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_139, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_172, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_31, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_31, ~y$w_buff1~0=v_~y$w_buff1~0_63, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_100, ~x~0=v_~x~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~y~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-06 06:19:05,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] L773-->L776: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [569] L865-->L877: Formula: (let ((.cse6 (not (= (mod v_~y$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse9 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse7 (not (= (mod v_~y$w_buff0_used~0_89 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd3~0_47 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0)))) (let ((.cse3 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse0 (and .cse7 .cse10)) (.cse4 (and .cse11 .cse9)) (.cse2 (and .cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_90 256) 0)) .cse10)) (.cse5 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse6))) (and (= v_~y$r_buff0_thd3~0_46 (ite .cse0 0 v_~y$r_buff0_thd3~0_47)) (= v_~y$w_buff0_used~0_89 (ite .cse1 0 v_~y$w_buff0_used~0_90)) (= v_~x~0_95 (ite .cse2 v_~x$w_buff0~0_61 (ite .cse3 v_~x$w_buff1~0_56 v_~x~0_96))) (= v_~x$w_buff1_used~0_132 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_133)) (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse5) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_80 256) 0))) (and .cse7 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0)))) 0 v_~y$r_buff1_thd3~0_34) v_~y$r_buff1_thd3~0_33) (= v_~x$r_buff0_thd3~0_23 (ite .cse4 0 v_~x$r_buff0_thd3~0_24)) (= (ite .cse2 0 v_~x$w_buff0_used~0_152) v_~x$w_buff0_used~0_151) (= v_~y~0_58 (ite .cse1 v_~y$w_buff0~0_40 (ite .cse5 v_~y$w_buff1~0_33 v_~y~0_59))) (= v_~x$r_buff1_thd3~0_23 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse8) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse9)) 0 v_~x$r_buff1_thd3~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_59, ~x~0=v_~x~0_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_58, ~x~0=v_~x~0_95, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-06 06:19:05,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] L773-->L776: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [676] $Ultimate##0-->L803: Formula: (and (= v_~x$r_buff1_thd3~0_96 v_~x$r_buff0_thd3~0_85) (= v_~x$r_buff1_thd4~0_53 v_~x$r_buff0_thd4~0_51) (= v_~x$w_buff0~0_162 v_~x$w_buff1~0_145) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11|) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_101) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_277 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_303 256))))) 1 0)) (= v_~x$r_buff1_thd1~0_45 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff0_thd0~0_101 v_~x$r_buff1_thd0~0_107) (= v_~x$r_buff0_thd2~0_100 1) (= v_~x$w_buff0_used~0_304 v_~x$w_buff1_used~0_277) (= 2 v_~x$w_buff0~0_161) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$w_buff0_used~0_303 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_162, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_101, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_85, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_101, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_304} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_161, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_101, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_145, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_277, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_85, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_107, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_303, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-06 06:19:05,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:19:05,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-06 06:19:05,483 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 299 flow [2022-12-06 06:19:05,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:05,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:05,483 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, 1] [2022-12-06 06:19:05,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:19:05,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:19:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash 950447075, now seen corresponding path program 1 times [2022-12-06 06:19:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:05,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418623892] [2022-12-06 06:19:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:05,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:05,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418623892] [2022-12-06 06:19:05,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418623892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:05,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:05,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:19:05,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320093205] [2022-12-06 06:19:05,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:05,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:05,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:05,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-06 06:19:05,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:05,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:05,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-06 06:19:05,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:06,342 INFO L130 PetriNetUnfolder]: 3234/4879 cut-off events. [2022-12-06 06:19:06,343 INFO L131 PetriNetUnfolder]: For 5932/6066 co-relation queries the response was YES. [2022-12-06 06:19:06,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16699 conditions, 4879 events. 3234/4879 cut-off events. For 5932/6066 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26765 event pairs, 547 based on Foata normal form. 158/4979 useless extension candidates. Maximal degree in co-relation 16678. Up to 2022 conditions per place. [2022-12-06 06:19:06,360 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 101 selfloop transitions, 17 changer transitions 10/132 dead transitions. [2022-12-06 06:19:06,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 132 transitions, 891 flow [2022-12-06 06:19:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 06:19:06,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:19:06,366 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 299 flow. Second operand 6 states and 108 transitions. [2022-12-06 06:19:06,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 132 transitions, 891 flow [2022-12-06 06:19:06,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 132 transitions, 837 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 06:19:06,452 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 312 flow [2022-12-06 06:19:06,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-06 06:19:06,455 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2022-12-06 06:19:06,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:06,455 INFO L89 Accepts]: Start accepts. Operand has 59 places, 56 transitions, 312 flow [2022-12-06 06:19:06,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:06,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:06,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 312 flow [2022-12-06 06:19:06,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 312 flow [2022-12-06 06:19:06,517 INFO L130 PetriNetUnfolder]: 209/465 cut-off events. [2022-12-06 06:19:06,517 INFO L131 PetriNetUnfolder]: For 531/606 co-relation queries the response was YES. [2022-12-06 06:19:06,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 465 events. 209/465 cut-off events. For 531/606 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2529 event pairs, 7 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 1406. Up to 129 conditions per place. [2022-12-06 06:19:06,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 312 flow [2022-12-06 06:19:06,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 802 [2022-12-06 06:24:39,634 WARN L233 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 3631 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 06:27:11,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L890-->L893: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] and [733] $Ultimate##0-->L905: Formula: (let ((.cse6 (not (= (mod v_~y$w_buff0_used~0_485 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd4~0_116 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd4~0_120 256) 0))) (.cse9 (not (= (mod v_~x$r_buff1_thd4~0_124 256) 0))) (.cse8 (not (= (mod v_~x$w_buff0_used~0_735 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd4~0_122 256) 0)))) (let ((.cse0 (and .cse8 .cse10)) (.cse1 (and .cse9 (not (= (mod v_~x$w_buff1_used~0_689 256) 0)))) (.cse7 (and (not (= (mod v_~y$w_buff0_used~0_486 256) 0)) .cse11)) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff1_used~0_456 256) 0)))) (.cse4 (and .cse6 .cse11)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_736 256) 0)) .cse10))) (and (= v_~x$r_buff0_thd4~0_121 (ite .cse0 0 v_~x$r_buff0_thd4~0_122)) (= v_~x$w_buff1_used~0_688 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_689)) (= (ite .cse2 v_~x$w_buff0~0_459 (ite .cse1 v_~x$w_buff1~0_424 1)) v_~x~0_651) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_456) v_~y$w_buff1_used~0_455) (= (ite (or (and (not (= 0 (mod v_~y$w_buff1_used~0_455 256))) .cse5) (and .cse6 (not (= (mod v_~y$r_buff0_thd4~0_119 256) 0)))) 0 v_~y$r_buff1_thd4~0_116) v_~y$r_buff1_thd4~0_115) (= (ite .cse7 0 v_~y$w_buff0_used~0_486) v_~y$w_buff0_used~0_485) (= v_~a~0_46 1) (= v_~y~0_402 (ite .cse7 v_~y$w_buff0~0_286 (ite .cse3 v_~y$w_buff1~0_260 v_~y~0_403))) (= (ite .cse4 0 v_~y$r_buff0_thd4~0_120) v_~y$r_buff0_thd4~0_119) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd4~0_121 256) 0)) .cse8) (and (not (= (mod v_~x$w_buff1_used~0_688 256) 0)) .cse9)) 0 v_~x$r_buff1_thd4~0_124) v_~x$r_buff1_thd4~0_123) (= (ite .cse2 0 v_~x$w_buff0_used~0_736) v_~x$w_buff0_used~0_735) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_459, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_486, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_689, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_122, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_736, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_260, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_286, ~y~0=v_~y~0_403, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_456} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_459, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_485, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_688, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_121, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_123, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_735, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_119, ~a~0=v_~a~0_46, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_260, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_286, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_402, ~x~0=v_~x~0_651, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_455} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~y$r_buff0_thd4~0, ~a~0, ~y$r_buff1_thd4~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, ~y$w_buff1_used~0] [2022-12-06 06:27:11,831 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:27:11,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 485376 [2022-12-06 06:27:11,831 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 316 flow [2022-12-06 06:27:11,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:11,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:11,832 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, 1, 1] [2022-12-06 06:27:11,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:27:11,832 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:27:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1153528560, now seen corresponding path program 1 times [2022-12-06 06:27:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:11,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124565256] [2022-12-06 06:27:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:12,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124565256] [2022-12-06 06:27:12,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124565256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:12,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:12,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:27:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264006993] [2022-12-06 06:27:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:12,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:27:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:27:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:27:12,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 06:27:12,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:12,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:12,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 06:27:12,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:13,250 INFO L130 PetriNetUnfolder]: 3547/5662 cut-off events. [2022-12-06 06:27:13,250 INFO L131 PetriNetUnfolder]: For 10486/10488 co-relation queries the response was YES. [2022-12-06 06:27:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20517 conditions, 5662 events. 3547/5662 cut-off events. For 10486/10488 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 33338 event pairs, 831 based on Foata normal form. 1/5634 useless extension candidates. Maximal degree in co-relation 20497. Up to 2023 conditions per place. [2022-12-06 06:27:13,285 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 105 selfloop transitions, 7 changer transitions 40/154 dead transitions. [2022-12-06 06:27:13,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 154 transitions, 1260 flow [2022-12-06 06:27:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:27:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:27:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 06:27:13,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2022-12-06 06:27:13,287 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 316 flow. Second operand 6 states and 89 transitions. [2022-12-06 06:27:13,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 154 transitions, 1260 flow [2022-12-06 06:27:13,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 154 transitions, 1095 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-06 06:27:13,362 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 317 flow [2022-12-06 06:27:13,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2022-12-06 06:27:13,362 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2022-12-06 06:27:13,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:13,362 INFO L89 Accepts]: Start accepts. Operand has 58 places, 56 transitions, 317 flow [2022-12-06 06:27:13,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:13,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:13,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 317 flow [2022-12-06 06:27:13,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 317 flow [2022-12-06 06:27:13,441 INFO L130 PetriNetUnfolder]: 384/826 cut-off events. [2022-12-06 06:27:13,441 INFO L131 PetriNetUnfolder]: For 1116/1213 co-relation queries the response was YES. [2022-12-06 06:27:13,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 826 events. 384/826 cut-off events. For 1116/1213 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5359 event pairs, 23 based on Foata normal form. 40/795 useless extension candidates. Maximal degree in co-relation 2444. Up to 233 conditions per place. [2022-12-06 06:27:13,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 56 transitions, 317 flow [2022-12-06 06:27:13,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-06 06:27:27,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [569] L865-->L877: Formula: (let ((.cse6 (not (= (mod v_~y$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse9 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse7 (not (= (mod v_~y$w_buff0_used~0_89 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd3~0_47 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0)))) (let ((.cse3 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse0 (and .cse7 .cse10)) (.cse4 (and .cse11 .cse9)) (.cse2 (and .cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_90 256) 0)) .cse10)) (.cse5 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse6))) (and (= v_~y$r_buff0_thd3~0_46 (ite .cse0 0 v_~y$r_buff0_thd3~0_47)) (= v_~y$w_buff0_used~0_89 (ite .cse1 0 v_~y$w_buff0_used~0_90)) (= v_~x~0_95 (ite .cse2 v_~x$w_buff0~0_61 (ite .cse3 v_~x$w_buff1~0_56 v_~x~0_96))) (= v_~x$w_buff1_used~0_132 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_133)) (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse5) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_80 256) 0))) (and .cse7 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0)))) 0 v_~y$r_buff1_thd3~0_34) v_~y$r_buff1_thd3~0_33) (= v_~x$r_buff0_thd3~0_23 (ite .cse4 0 v_~x$r_buff0_thd3~0_24)) (= (ite .cse2 0 v_~x$w_buff0_used~0_152) v_~x$w_buff0_used~0_151) (= v_~y~0_58 (ite .cse1 v_~y$w_buff0~0_40 (ite .cse5 v_~y$w_buff1~0_33 v_~y~0_59))) (= v_~x$r_buff1_thd3~0_23 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse8) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse9)) 0 v_~x$r_buff1_thd3~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_59, ~x~0=v_~x~0_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_58, ~x~0=v_~x~0_95, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [730] L929-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse30 (not (= (mod v_~x$r_buff0_thd0~0_370 256) 0)))) (let ((.cse23 (and (not (= (mod v_~x$w_buff0_used~0_728 256) 0)) .cse30))) (let ((.cse19 (ite .cse23 0 v_~x$w_buff0_used~0_728))) (let ((.cse25 (= (mod .cse19 256) 0))) (let ((.cse28 (not .cse25))) (let ((.cse29 (and .cse30 .cse28))) (let ((.cse27 (not (= (mod v_~x$r_buff1_thd0~0_382 256) 0))) (.cse7 (ite .cse29 0 v_~x$r_buff0_thd0~0_370))) (let ((.cse9 (= 0 (mod .cse7 256))) (.cse24 (and .cse27 (not (= (mod v_~x$w_buff1_used~0_681 256) 0))))) (let ((.cse13 (ite (or .cse24 .cse29) 0 v_~x$w_buff1_used~0_681)) (.cse12 (not .cse9))) (let ((.cse21 (and .cse12 .cse28)) (.cse26 (= (mod .cse13 256) 0))) (let ((.cse15 (ite (or .cse21 (and .cse27 (not .cse26))) 0 v_~x$r_buff1_thd0~0_382))) (let ((.cse17 (= 0 (mod .cse15 256)))) (let ((.cse11 (and .cse9 .cse17)) (.cse14 (and .cse9 .cse26))) (let ((.cse22 (not (= (mod v_~y$r_buff0_thd0~0_180 256) 0))) (.cse5 (not (= 0 (mod v_~y$w_buff0_used~0_481 256)))) (.cse20 (or .cse25 .cse11 .cse14)) (.cse18 (ite .cse23 v_~x$w_buff0~0_454 (ite .cse24 v_~x$w_buff1~0_419 v_~x~0_644))) (.cse6 (not (= (mod v_~y$r_buff1_thd0~0_184 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_452 256) 0)) .cse6)) (.cse4 (ite .cse20 .cse18 (ite .cse21 v_~x$w_buff0~0_454 v_~x$w_buff1~0_419))) (.cse10 (= (mod v_~x$w_buff1_used~0_680 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_727 256) 0)) (.cse0 (and .cse22 .cse5)) (.cse2 (and .cse22 (not (= (mod v_~y$w_buff0_used~0_482 256) 0)))) (.cse3 (not (= (mod v_~weak$$choice2~0_254 256) 0)))) (and (= v_~y$w_buff1_used~0_451 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_452)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= v_~y~0_398 (ite .cse2 v_~y$w_buff0~0_284 (ite .cse1 v_~y$w_buff1~0_258 v_~y~0_399))) (= (ite .cse3 v_~x$mem_tmp~0_166 .cse4) v_~x~0_643) (= |v_ULTIMATE.start_main_#t~nondet15#1_187| v_~weak$$choice0~0_179) (= v_~x$flush_delayed~0_184 0) (= v_~x$w_buff1~0_419 v_~x$w_buff1~0_418) (= v_~y$r_buff1_thd0~0_183 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_179 256) 0)) .cse5) (and .cse6 (not (= (mod v_~y$w_buff1_used~0_451 256) 0)))) 0 v_~y$r_buff1_thd0~0_184)) (= v_~x$r_buff0_thd0~0_369 (ite .cse3 .cse7 (ite (or .cse8 (and .cse9 .cse10) .cse11) .cse7 (ite (and (not .cse8) .cse12) 0 .cse7)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_299 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_64) (= v_~x$w_buff1_used~0_680 (ite .cse3 .cse13 (ite (or .cse8 .cse11 .cse14) .cse13 0))) (= v_~weak$$choice2~0_254 |v_ULTIMATE.start_main_#t~nondet16#1_193|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_105| (mod v_~main$tmp_guard1~0_116 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_105| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_98 1) (= v_~__unbuffered_p1_EBX~0_130 0) (= 0 v_~__unbuffered_p3_EBX~0_96) (= 2 .cse4) (= v_~__unbuffered_p1_EAX~0_110 2) (= v_~__unbuffered_p2_EAX~0_106 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_116) (= (ite .cse3 .cse15 (ite (let ((.cse16 (= (mod v_~x$r_buff0_thd0~0_369 256) 0))) (or (and .cse10 .cse16) .cse8 (and .cse17 .cse16))) .cse15 0)) v_~x$r_buff1_thd0~0_381) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= v_~x$w_buff0~0_454 v_~x$w_buff0~0_453) (= v_~y$r_buff0_thd0~0_179 (ite .cse0 0 v_~y$r_buff0_thd0~0_180)) (= .cse18 v_~x$mem_tmp~0_166) (= v_~y$w_buff0_used~0_481 (ite .cse2 0 v_~y$w_buff0_used~0_482)) (= v_~x$w_buff0_used~0_727 (ite .cse3 .cse19 (ite .cse20 .cse19 (ite .cse21 0 .cse19)))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_454, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_370, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_130, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_482, ~x$w_buff1~0=v_~x$w_buff1~0_419, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_681, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_96, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_382, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_728, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_193|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_258, ~y$w_buff0~0=v_~y$w_buff0~0_284, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_180, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_299, ~y~0=v_~y~0_399, ~x~0=v_~x~0_644, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_184, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_187|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_452} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_453, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_481, ~x$flush_delayed~0=v_~x$flush_delayed~0_184, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ~x$mem_tmp~0=v_~x$mem_tmp~0_166, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$w_buff0~0=v_~y$w_buff0~0_284, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~y~0=v_~y~0_398, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_369, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_130, ~x$w_buff1~0=v_~x$w_buff1~0_418, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_680, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_381, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_727, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_63|, ~weak$$choice0~0=v_~weak$$choice0~0_179, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_105|, ~y$w_buff1~0=v_~y$w_buff1~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_179, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_299, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_643, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_183, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_451, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre13#1, ~y$w_buff0_used~0, ~x$flush_delayed~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~x$r_buff0_thd0~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet15#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:27:28,609 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:27:28,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15248 [2022-12-06 06:27:28,610 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 330 flow [2022-12-06 06:27:28,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:28,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:28,611 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, 1] [2022-12-06 06:27:28,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:27:28,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:27:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash 691882218, now seen corresponding path program 1 times [2022-12-06 06:27:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:28,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496625351] [2022-12-06 06:27:28,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:32,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:32,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496625351] [2022-12-06 06:27:32,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496625351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:27:32,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:27:32,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:27:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240227322] [2022-12-06 06:27:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:27:32,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:27:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:27:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:27:32,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:27:32,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 330 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:32,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:32,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:27:32,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:27:34,279 INFO L130 PetriNetUnfolder]: 7144/11201 cut-off events. [2022-12-06 06:27:34,280 INFO L131 PetriNetUnfolder]: For 17389/17389 co-relation queries the response was YES. [2022-12-06 06:27:34,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41033 conditions, 11201 events. 7144/11201 cut-off events. For 17389/17389 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 71865 event pairs, 968 based on Foata normal form. 4/11205 useless extension candidates. Maximal degree in co-relation 41011. Up to 3121 conditions per place. [2022-12-06 06:27:34,307 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 106 selfloop transitions, 12 changer transitions 123/241 dead transitions. [2022-12-06 06:27:34,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 241 transitions, 1824 flow [2022-12-06 06:27:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:27:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:27:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-12-06 06:27:34,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 06:27:34,310 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 330 flow. Second operand 9 states and 120 transitions. [2022-12-06 06:27:34,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 241 transitions, 1824 flow [2022-12-06 06:27:34,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 241 transitions, 1807 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:27:34,555 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 435 flow [2022-12-06 06:27:34,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=435, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2022-12-06 06:27:34,556 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2022-12-06 06:27:34,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:34,556 INFO L89 Accepts]: Start accepts. Operand has 69 places, 64 transitions, 435 flow [2022-12-06 06:27:34,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:34,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:34,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 64 transitions, 435 flow [2022-12-06 06:27:34,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 435 flow [2022-12-06 06:27:34,670 INFO L130 PetriNetUnfolder]: 598/1400 cut-off events. [2022-12-06 06:27:34,670 INFO L131 PetriNetUnfolder]: For 2427/2490 co-relation queries the response was YES. [2022-12-06 06:27:34,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4532 conditions, 1400 events. 598/1400 cut-off events. For 2427/2490 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10667 event pairs, 59 based on Foata normal form. 35/1338 useless extension candidates. Maximal degree in co-relation 4507. Up to 398 conditions per place. [2022-12-06 06:27:34,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 435 flow [2022-12-06 06:27:34,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 06:27:34,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:27:34,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-06 06:27:34,960 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 438 flow [2022-12-06 06:27:34,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:34,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:34,960 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 06:27:34,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:27:34,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 06:27:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -924491636, now seen corresponding path program 1 times [2022-12-06 06:27:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416586639] [2022-12-06 06:27:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:27:35,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:27:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:27:35,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:27:35,163 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:27:35,164 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-12-06 06:27:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-12-06 06:27:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-12-06 06:27:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2022-12-06 06:27:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-12-06 06:27:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-12-06 06:27:35,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-12-06 06:27:35,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-12-06 06:27:35,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-12-06 06:27:35,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:27:35,166 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:35,170 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:27:35,170 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:27:35,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:27:35 BasicIcfg [2022-12-06 06:27:35,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:27:35,265 INFO L158 Benchmark]: Toolchain (without parser) took 532708.30ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 133.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 656.9MB. Max. memory is 8.0GB. [2022-12-06 06:27:35,265 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 103.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:27:35,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.97ms. Allocated memory is still 159.4MB. Free memory was 133.6MB in the beginning and 101.1MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 06:27:35,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.95ms. Allocated memory is still 159.4MB. Free memory was 101.1MB in the beginning and 97.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-06 06:27:35,266 INFO L158 Benchmark]: Boogie Preprocessor took 45.25ms. Allocated memory is still 159.4MB. Free memory was 97.4MB in the beginning and 94.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:27:35,266 INFO L158 Benchmark]: RCFGBuilder took 1187.02ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 94.8MB in the beginning and 119.8MB in the end (delta: -25.0MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. [2022-12-06 06:27:35,266 INFO L158 Benchmark]: TraceAbstraction took 530606.36ms. Allocated memory was 191.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 118.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 608.0MB. Max. memory is 8.0GB. [2022-12-06 06:27:35,267 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.11ms. Allocated memory is still 159.4MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 103.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 813.97ms. Allocated memory is still 159.4MB. Free memory was 133.6MB in the beginning and 101.1MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.95ms. Allocated memory is still 159.4MB. Free memory was 101.1MB in the beginning and 97.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.25ms. Allocated memory is still 159.4MB. Free memory was 97.4MB in the beginning and 94.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1187.02ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 94.8MB in the beginning and 119.8MB in the end (delta: -25.0MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. * TraceAbstraction took 530606.36ms. Allocated memory was 191.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 118.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 608.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 159 PlacesBefore, 49 PlacesAfterwards, 148 TransitionsBefore, 37 TransitionsAfterwards, 3408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2583, independent: 2505, independent conditional: 2505, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2583, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2583, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2583, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2004, independent: 1946, independent conditional: 0, independent unconditional: 1946, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2004, independent: 1907, independent conditional: 0, independent unconditional: 1907, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 705, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 672, dependent conditional: 0, dependent unconditional: 672, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2583, independent: 559, independent conditional: 0, independent unconditional: 559, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 2004, unknown conditional: 0, unknown unconditional: 2004] , Statistics on independence cache: Total cache size (in pairs): 2966, Positive cache size: 2908, Positive conditional cache size: 0, Positive unconditional cache size: 2908, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, 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, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, independent: 214, independent conditional: 214, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 248, independent: 214, independent conditional: 15, independent unconditional: 199, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, independent: 214, independent conditional: 15, independent unconditional: 199, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, independent: 214, independent conditional: 15, independent unconditional: 199, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 217, independent: 190, independent conditional: 13, independent unconditional: 177, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 217, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 87, dependent conditional: 9, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 217, unknown conditional: 15, unknown unconditional: 202] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 190, Positive conditional cache size: 13, Positive unconditional cache size: 177, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 178, independent conditional: 13, independent unconditional: 165, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 178, independent conditional: 13, independent unconditional: 165, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 178, independent conditional: 13, independent unconditional: 165, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 1, independent unconditional: 21, 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: 26, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 12, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 156, independent conditional: 12, independent unconditional: 144, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 26, unknown conditional: 3, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 212, Positive conditional cache size: 14, Positive unconditional cache size: 198, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 358, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 358, independent: 301, independent conditional: 16, independent unconditional: 285, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 358, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 358, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 12, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 358, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 233, Positive conditional cache size: 15, Positive unconditional cache size: 218, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 135, independent conditional: 8, independent unconditional: 127, dependent: 27, dependent conditional: 3, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 27, dependent conditional: 0, dependent unconditional: 27, 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: 0, dependent unconditional: 2, 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: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 233, Positive conditional cache size: 15, Positive unconditional cache size: 218, Negative cache size: 36, Negative conditional cache size: 4, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 94, independent conditional: 7, independent unconditional: 87, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119, independent: 94, independent conditional: 7, independent unconditional: 87, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119, independent: 94, independent conditional: 7, independent unconditional: 87, dependent: 25, dependent conditional: 0, dependent unconditional: 25, 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: 119, independent: 94, independent conditional: 7, independent unconditional: 87, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 233, Positive conditional cache size: 15, Positive unconditional cache size: 218, Negative cache size: 36, Negative conditional cache size: 4, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 95, independent conditional: 95, 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: 124, independent: 95, independent conditional: 4, independent unconditional: 91, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 95, independent conditional: 4, independent unconditional: 91, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 95, independent conditional: 4, independent unconditional: 91, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 86, independent conditional: 4, independent unconditional: 82, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 242, Positive conditional cache size: 15, Positive unconditional cache size: 227, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 116, independent conditional: 31, independent unconditional: 85, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, independent: 116, independent conditional: 31, independent unconditional: 85, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 116, independent conditional: 31, independent unconditional: 85, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 108, independent conditional: 25, independent unconditional: 83, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 250, Positive conditional cache size: 21, Positive unconditional cache size: 229, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 602 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139, independent: 107, independent conditional: 13, independent unconditional: 94, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 107, independent conditional: 13, independent unconditional: 94, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 107, independent conditional: 13, independent unconditional: 94, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 105, independent conditional: 13, independent unconditional: 92, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 252, Positive conditional cache size: 21, Positive unconditional cache size: 231, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 58 PlacesBefore, 57 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 381, independent: 358, independent conditional: 358, 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: 381, independent: 358, independent conditional: 257, independent unconditional: 101, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 381, independent: 358, independent conditional: 155, independent unconditional: 203, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 381, independent: 358, independent conditional: 155, independent unconditional: 203, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 381, independent: 353, independent conditional: 155, independent unconditional: 198, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 294, Positive conditional cache size: 21, Positive unconditional cache size: 273, Negative cache size: 43, Negative conditional cache size: 4, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 102, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 485.3s, 58 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 53 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 595, independent: 557, independent conditional: 557, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 595, independent: 557, independent conditional: 371, independent unconditional: 186, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 595, independent: 557, independent conditional: 356, independent unconditional: 201, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 595, independent: 557, independent conditional: 356, independent unconditional: 201, dependent: 38, dependent conditional: 2, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 595, independent: 544, independent conditional: 345, independent unconditional: 199, dependent: 37, dependent conditional: 1, dependent unconditional: 36, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 397, Positive conditional cache size: 36, Positive unconditional cache size: 361, Negative cache size: 44, Negative conditional cache size: 5, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2s, 57 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 354, independent conditional: 354, 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: 377, independent: 354, independent conditional: 304, independent unconditional: 50, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 382, independent: 354, independent conditional: 262, independent unconditional: 92, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 382, independent: 354, independent conditional: 262, independent unconditional: 92, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 382, independent: 336, independent conditional: 244, independent unconditional: 92, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 416, Positive conditional cache size: 54, Positive unconditional cache size: 362, Negative cache size: 48, Negative conditional cache size: 9, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 66 PlacesBefore, 66 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 80, independent conditional: 67, independent unconditional: 13, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, independent: 80, independent conditional: 61, independent unconditional: 19, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 80, independent conditional: 61, independent unconditional: 19, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 63, independent conditional: 47, independent unconditional: 16, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 19, unknown conditional: 16, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 433, Positive conditional cache size: 68, Positive unconditional cache size: 365, Negative cache size: 50, Negative conditional cache size: 11, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool y$flush_delayed; [L748] 0 int y$mem_tmp; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L754] 0 _Bool y$r_buff1_thd0; [L755] 0 _Bool y$r_buff1_thd1; [L756] 0 _Bool y$r_buff1_thd2; [L757] 0 _Bool y$r_buff1_thd3; [L758] 0 _Bool y$r_buff1_thd4; [L759] 0 _Bool y$read_delayed; [L760] 0 int *y$read_delayed_var; [L761] 0 int y$w_buff0; [L762] 0 _Bool y$w_buff0_used; [L763] 0 int y$w_buff1; [L764] 0 _Bool y$w_buff1_used; [L766] 0 int z = 0; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t377, ((void *)0), P0, ((void *)0))=-3, t377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t378, ((void *)0), P1, ((void *)0))=-2, t377={5:0}, t378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L926] 0 pthread_t t379; [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t379, ((void *)0), P2, ((void *)0))=-1, t377={5:0}, t378={6:0}, t379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L928] 0 pthread_t t380; [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t380, ((void *)0), P3, ((void *)0))=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L886] 4 z = 1 [L889] 4 __unbuffered_p3_EAX = z [L892] 4 __unbuffered_p3_EBX = a [L772] 4 a = 1 [L775] 4 x = 1 [L895] 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) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 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 [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 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 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 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) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L909] 4 return 0; [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L826] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L827] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L828] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L829] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L830] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L831] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 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) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 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) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 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 [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 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 [L872] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L881] 3 return 0; [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 2 return 0; [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 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) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 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 [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 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 [L940] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 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) [L952] 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)) [L953] 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)) [L954] 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)) [L955] 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)) [L956] 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)) [L957] 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)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 923]: 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: 925]: 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: 927]: 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: 929]: 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, 191 locations, 9 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: 530.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 546 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1288 IncrementalHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 11 mSDtfsCounter, 1288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=12, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:27:35,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...