/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:19:32,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:19:32,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:19:32,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:19:32,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:19:32,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:19:32,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:19:32,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:19:32,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:19:32,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:19:32,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:19:32,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:19:32,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:19:32,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:19:32,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:19:32,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:19:32,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:19:32,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:19:32,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:19:32,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:19:32,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:19:32,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:19:32,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:19:32,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:19:32,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:19:32,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:19:32,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:19:32,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:19:32,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:19:32,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:19:32,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:19:32,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:19:32,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:19:32,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:19:32,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:19:32,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:19:32,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:19:32,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:19:32,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:19:32,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:19:32,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:19:32,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:19:32,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:19:32,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:19:32,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:19:32,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:19:32,146 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:19:32,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:19:32,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:19:32,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:19:32,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:19:32,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:19:32,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:19:32,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:19:32,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:19:32,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:19:32,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:19:32,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:19:32,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:19:32,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:19:32,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:19:32,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:19:32,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:19:32,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:32,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:19:32,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:19:32,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:19:32,150 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:19:32,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:19:32,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:19:32,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:19:32,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:19:32,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:19:32,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:19:32,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:19:32,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:19:32,389 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:19:32,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-13 09:19:33,232 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:19:33,434 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:19:33,435 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-13 09:19:33,446 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0810c23e6/30984b996d0a4624b947c93199f6d419/FLAGbd176be11 [2022-12-13 09:19:33,455 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0810c23e6/30984b996d0a4624b947c93199f6d419 [2022-12-13 09:19:33,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:19:33,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:19:33,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:33,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:19:33,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:19:33,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8d1e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33, skipping insertion in model container [2022-12-13 09:19:33,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:19:33,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:19:33,656 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/mix013.opt.i[944,957] [2022-12-13 09:19:33,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:33,856 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:19:33,865 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/mix013.opt.i[944,957] [2022-12-13 09:19:33,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:33,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:33,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:33,922 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:19:33,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33 WrapperNode [2022-12-13 09:19:33,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:33,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:33,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:19:33,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:19:33,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,964 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-13 09:19:33,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:33,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:19:33,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:19:33,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:19:33,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,986 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:19:33,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:19:33,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:19:33,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:19:33,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (1/1) ... [2022-12-13 09:19:33,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:19:34,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:19:34,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:19:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:19:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:19:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:19:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:19:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:19:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:19:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:19:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:19:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:19:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:19:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:19:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:19:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:19:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:19:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:19:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:19:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:19:34,043 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:19:34,191 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:19:34,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:19:34,392 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:19:34,500 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:19:34,500 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:19:34,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:34 BoogieIcfgContainer [2022-12-13 09:19:34,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:19:34,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:19:34,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:19:34,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:19:34,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:19:33" (1/3) ... [2022-12-13 09:19:34,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4878fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:34, skipping insertion in model container [2022-12-13 09:19:34,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:33" (2/3) ... [2022-12-13 09:19:34,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4878fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:34, skipping insertion in model container [2022-12-13 09:19:34,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:34" (3/3) ... [2022-12-13 09:19:34,508 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2022-12-13 09:19:34,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:19:34,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:19:34,520 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:19:34,566 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:19:34,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 09:19:34,656 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 09:19:34,656 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:34,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 09:19:34,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 09:19:34,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-13 09:19:34,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:34,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 09:19:34,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-13 09:19:34,731 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 09:19:34,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:34,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 09:19:34,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 09:19:34,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 2850 [2022-12-13 09:19:39,609 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-13 09:19:39,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:19:39,625 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;@54a760a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:19:39,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 09:19:39,629 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 09:19:39,629 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:39,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:39,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:39,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1639690117, now seen corresponding path program 1 times [2022-12-13 09:19:39,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:39,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464298682] [2022-12-13 09:19:39,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:40,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:40,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464298682] [2022-12-13 09:19:40,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464298682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:40,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:40,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133951214] [2022-12-13 09:19:40,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:40,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:40,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 65 [2022-12-13 09:19:40,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:40,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:40,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 65 [2022-12-13 09:19:40,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:44,050 INFO L130 PetriNetUnfolder]: 40551/58273 cut-off events. [2022-12-13 09:19:44,050 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-13 09:19:44,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112193 conditions, 58273 events. 40551/58273 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 4222. Compared 461183 event pairs, 5311 based on Foata normal form. 0/35858 useless extension candidates. Maximal degree in co-relation 112181. Up to 46041 conditions per place. [2022-12-13 09:19:44,211 INFO L137 encePairwiseOnDemand]: 61/65 looper letters, 37 selfloop transitions, 2 changer transitions 46/99 dead transitions. [2022-12-13 09:19:44,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 380 flow [2022-12-13 09:19:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-12-13 09:19:44,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:19:44,324 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 142 flow. Second operand 3 states and 130 transitions. [2022-12-13 09:19:44,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 380 flow [2022-12-13 09:19:44,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 376 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:19:44,328 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 92 flow [2022-12-13 09:19:44,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2022-12-13 09:19:44,332 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-13 09:19:44,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:44,333 INFO L89 Accepts]: Start accepts. Operand has 74 places, 40 transitions, 92 flow [2022-12-13 09:19:44,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:44,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:44,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 40 transitions, 92 flow [2022-12-13 09:19:44,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2022-12-13 09:19:44,350 INFO L130 PetriNetUnfolder]: 0/40 cut-off events. [2022-12-13 09:19:44,350 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:44,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 103 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:19:44,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 92 flow [2022-12-13 09:19:44,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-13 09:19:44,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:44,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 09:19:44,482 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 92 flow [2022-12-13 09:19:44,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:44,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:44,482 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:44,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:19:44,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 510921208, now seen corresponding path program 1 times [2022-12-13 09:19:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:44,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957626096] [2022-12-13 09:19:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:44,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957626096] [2022-12-13 09:19:44,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957626096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:44,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:44,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:44,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305616775] [2022-12-13 09:19:44,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:44,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:44,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:44,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 09:19:44,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:44,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:44,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 09:19:44,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:45,975 INFO L130 PetriNetUnfolder]: 16998/23682 cut-off events. [2022-12-13 09:19:45,975 INFO L131 PetriNetUnfolder]: For 734/734 co-relation queries the response was YES. [2022-12-13 09:19:46,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47403 conditions, 23682 events. 16998/23682 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 131356 event pairs, 8337 based on Foata normal form. 0/18729 useless extension candidates. Maximal degree in co-relation 47393. Up to 22364 conditions per place. [2022-12-13 09:19:46,075 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 2/57 dead transitions. [2022-12-13 09:19:46,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 230 flow [2022-12-13 09:19:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 09:19:46,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 09:19:46,076 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 92 flow. Second operand 3 states and 76 transitions. [2022-12-13 09:19:46,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 230 flow [2022-12-13 09:19:46,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:46,078 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 119 flow [2022-12-13 09:19:46,079 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-13 09:19:46,079 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2022-12-13 09:19:46,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:46,079 INFO L89 Accepts]: Start accepts. Operand has 52 places, 43 transitions, 119 flow [2022-12-13 09:19:46,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:46,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:46,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 119 flow [2022-12-13 09:19:46,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 119 flow [2022-12-13 09:19:46,091 INFO L130 PetriNetUnfolder]: 45/199 cut-off events. [2022-12-13 09:19:46,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:46,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 199 events. 45/199 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1056 event pairs, 23 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 282. Up to 76 conditions per place. [2022-12-13 09:19:46,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 119 flow [2022-12-13 09:19:46,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 984 [2022-12-13 09:19:46,128 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:46,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 09:19:46,132 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 119 flow [2022-12-13 09:19:46,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:46,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:46,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:46,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:19:46,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash 318429904, now seen corresponding path program 1 times [2022-12-13 09:19:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:46,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248333392] [2022-12-13 09:19:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:46,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:46,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248333392] [2022-12-13 09:19:46,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248333392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:46,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:46,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642483321] [2022-12-13 09:19:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:46,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:46,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:46,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 09:19:46,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:46,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:46,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 09:19:46,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:47,204 INFO L130 PetriNetUnfolder]: 12577/17592 cut-off events. [2022-12-13 09:19:47,204 INFO L131 PetriNetUnfolder]: For 2733/2733 co-relation queries the response was YES. [2022-12-13 09:19:47,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38551 conditions, 17592 events. 12577/17592 cut-off events. For 2733/2733 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 92387 event pairs, 3513 based on Foata normal form. 284/14872 useless extension candidates. Maximal degree in co-relation 38540. Up to 12401 conditions per place. [2022-12-13 09:19:47,284 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2022-12-13 09:19:47,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 253 flow [2022-12-13 09:19:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 09:19:47,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6239316239316239 [2022-12-13 09:19:47,286 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 119 flow. Second operand 3 states and 73 transitions. [2022-12-13 09:19:47,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 253 flow [2022-12-13 09:19:47,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:19:47,287 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 125 flow [2022-12-13 09:19:47,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-13 09:19:47,288 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2022-12-13 09:19:47,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:47,288 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 125 flow [2022-12-13 09:19:47,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:47,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:47,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 125 flow [2022-12-13 09:19:47,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 125 flow [2022-12-13 09:19:47,296 INFO L130 PetriNetUnfolder]: 29/128 cut-off events. [2022-12-13 09:19:47,297 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-12-13 09:19:47,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 128 events. 29/128 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 607 event pairs, 11 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 208. Up to 53 conditions per place. [2022-12-13 09:19:47,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 125 flow [2022-12-13 09:19:47,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 980 [2022-12-13 09:19:47,315 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:47,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 09:19:47,316 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 125 flow [2022-12-13 09:19:47,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:47,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:47,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:47,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:19:47,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1265487897, now seen corresponding path program 1 times [2022-12-13 09:19:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:47,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75505100] [2022-12-13 09:19:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:47,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75505100] [2022-12-13 09:19:47,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75505100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:47,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:47,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289865158] [2022-12-13 09:19:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:47,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:47,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:47,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 09:19:47,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:47,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:47,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 09:19:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:48,557 INFO L130 PetriNetUnfolder]: 11727/16573 cut-off events. [2022-12-13 09:19:48,557 INFO L131 PetriNetUnfolder]: For 4589/4589 co-relation queries the response was YES. [2022-12-13 09:19:48,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37229 conditions, 16573 events. 11727/16573 cut-off events. For 4589/4589 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 91003 event pairs, 4351 based on Foata normal form. 250/13969 useless extension candidates. Maximal degree in co-relation 37216. Up to 11568 conditions per place. [2022-12-13 09:19:48,642 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 51 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-13 09:19:48,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 286 flow [2022-12-13 09:19:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 09:19:48,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:19:48,643 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 125 flow. Second operand 3 states and 78 transitions. [2022-12-13 09:19:48,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 286 flow [2022-12-13 09:19:48,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:48,648 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 130 flow [2022-12-13 09:19:48,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 09:19:48,649 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -24 predicate places. [2022-12-13 09:19:48,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:48,649 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 130 flow [2022-12-13 09:19:48,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:48,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:48,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 130 flow [2022-12-13 09:19:48,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 130 flow [2022-12-13 09:19:48,660 INFO L130 PetriNetUnfolder]: 21/116 cut-off events. [2022-12-13 09:19:48,660 INFO L131 PetriNetUnfolder]: For 19/33 co-relation queries the response was YES. [2022-12-13 09:19:48,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 116 events. 21/116 cut-off events. For 19/33 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 548 event pairs, 8 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 192. Up to 41 conditions per place. [2022-12-13 09:19:48,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 130 flow [2022-12-13 09:19:48,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 976 [2022-12-13 09:19:48,664 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:48,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 09:19:48,665 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 130 flow [2022-12-13 09:19:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:48,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:48,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:48,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:19:48,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:48,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:48,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1635787044, now seen corresponding path program 1 times [2022-12-13 09:19:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:48,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915241399] [2022-12-13 09:19:48,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915241399] [2022-12-13 09:19:48,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915241399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:48,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:48,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359974911] [2022-12-13 09:19:48,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:48,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:48,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:48,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:48,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 09:19:48,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:48,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:48,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 09:19:48,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:50,132 INFO L130 PetriNetUnfolder]: 15435/20942 cut-off events. [2022-12-13 09:19:50,132 INFO L131 PetriNetUnfolder]: For 5365/5479 co-relation queries the response was YES. [2022-12-13 09:19:50,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46924 conditions, 20942 events. 15435/20942 cut-off events. For 5365/5479 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 122863 event pairs, 5606 based on Foata normal form. 82/13168 useless extension candidates. Maximal degree in co-relation 46910. Up to 20380 conditions per place. [2022-12-13 09:19:50,204 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 44 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2022-12-13 09:19:50,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 305 flow [2022-12-13 09:19:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 09:19:50,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7094017094017094 [2022-12-13 09:19:50,205 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 130 flow. Second operand 3 states and 83 transitions. [2022-12-13 09:19:50,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 305 flow [2022-12-13 09:19:50,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:50,207 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 213 flow [2022-12-13 09:19:50,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2022-12-13 09:19:50,208 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-13 09:19:50,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:50,208 INFO L89 Accepts]: Start accepts. Operand has 55 places, 55 transitions, 213 flow [2022-12-13 09:19:50,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:50,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:50,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 213 flow [2022-12-13 09:19:50,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 213 flow [2022-12-13 09:19:50,355 INFO L130 PetriNetUnfolder]: 2612/4222 cut-off events. [2022-12-13 09:19:50,355 INFO L131 PetriNetUnfolder]: For 519/579 co-relation queries the response was YES. [2022-12-13 09:19:50,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8573 conditions, 4222 events. 2612/4222 cut-off events. For 519/579 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 29157 event pairs, 1434 based on Foata normal form. 3/1915 useless extension candidates. Maximal degree in co-relation 8561. Up to 3637 conditions per place. [2022-12-13 09:19:50,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 213 flow [2022-12-13 09:19:50,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-13 09:19:50,410 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:50,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-13 09:19:50,411 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 213 flow [2022-12-13 09:19:50,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:50,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:50,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:50,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:19:50,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1983882691, now seen corresponding path program 1 times [2022-12-13 09:19:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318380005] [2022-12-13 09:19:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:50,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318380005] [2022-12-13 09:19:50,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318380005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:50,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:50,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937805029] [2022-12-13 09:19:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:50,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:50,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:50,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 09:19:50,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:50,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:50,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 09:19:50,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:51,428 INFO L130 PetriNetUnfolder]: 11013/15605 cut-off events. [2022-12-13 09:19:51,429 INFO L131 PetriNetUnfolder]: For 5007/6264 co-relation queries the response was YES. [2022-12-13 09:19:51,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45185 conditions, 15605 events. 11013/15605 cut-off events. For 5007/6264 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 95896 event pairs, 2276 based on Foata normal form. 404/10191 useless extension candidates. Maximal degree in co-relation 45170. Up to 13600 conditions per place. [2022-12-13 09:19:51,520 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 55 selfloop transitions, 25 changer transitions 0/91 dead transitions. [2022-12-13 09:19:51,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 489 flow [2022-12-13 09:19:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:19:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:19:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-13 09:19:51,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2022-12-13 09:19:51,522 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 213 flow. Second operand 4 states and 115 transitions. [2022-12-13 09:19:51,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 489 flow [2022-12-13 09:19:51,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:19:51,525 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 348 flow [2022-12-13 09:19:51,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2022-12-13 09:19:51,526 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-13 09:19:51,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:51,526 INFO L89 Accepts]: Start accepts. Operand has 58 places, 67 transitions, 348 flow [2022-12-13 09:19:51,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:51,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:51,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 67 transitions, 348 flow [2022-12-13 09:19:51,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 348 flow [2022-12-13 09:19:51,658 INFO L130 PetriNetUnfolder]: 2024/3472 cut-off events. [2022-12-13 09:19:51,658 INFO L131 PetriNetUnfolder]: For 588/1068 co-relation queries the response was YES. [2022-12-13 09:19:51,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10324 conditions, 3472 events. 2024/3472 cut-off events. For 588/1068 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 24394 event pairs, 582 based on Foata normal form. 11/1648 useless extension candidates. Maximal degree in co-relation 10310. Up to 2989 conditions per place. [2022-12-13 09:19:51,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 67 transitions, 348 flow [2022-12-13 09:19:51,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-13 09:19:51,695 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:51,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 09:19:51,696 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 348 flow [2022-12-13 09:19:51,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:51,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:51,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:51,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:19:51,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:51,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 732133419, now seen corresponding path program 1 times [2022-12-13 09:19:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:51,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264430137] [2022-12-13 09:19:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:51,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:51,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264430137] [2022-12-13 09:19:51,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264430137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:51,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:51,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794071387] [2022-12-13 09:19:51,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:51,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:51,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:51,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2022-12-13 09:19:51,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:51,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:51,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2022-12-13 09:19:51,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:53,186 INFO L130 PetriNetUnfolder]: 15064/22701 cut-off events. [2022-12-13 09:19:53,186 INFO L131 PetriNetUnfolder]: For 17499/20029 co-relation queries the response was YES. [2022-12-13 09:19:53,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77828 conditions, 22701 events. 15064/22701 cut-off events. For 17499/20029 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 161506 event pairs, 2678 based on Foata normal form. 866/18878 useless extension candidates. Maximal degree in co-relation 77811. Up to 13516 conditions per place. [2022-12-13 09:19:53,317 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 111 selfloop transitions, 3 changer transitions 4/137 dead transitions. [2022-12-13 09:19:53,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 137 transitions, 958 flow [2022-12-13 09:19:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:19:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:19:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 09:19:53,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 09:19:53,319 INFO L175 Difference]: Start difference. First operand has 58 places, 67 transitions, 348 flow. Second operand 4 states and 112 transitions. [2022-12-13 09:19:53,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 137 transitions, 958 flow [2022-12-13 09:19:53,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 137 transitions, 852 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:53,324 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 323 flow [2022-12-13 09:19:53,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2022-12-13 09:19:53,325 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -17 predicate places. [2022-12-13 09:19:53,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:53,325 INFO L89 Accepts]: Start accepts. Operand has 61 places, 69 transitions, 323 flow [2022-12-13 09:19:53,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:53,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:53,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 69 transitions, 323 flow [2022-12-13 09:19:53,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 69 transitions, 323 flow [2022-12-13 09:19:53,564 INFO L130 PetriNetUnfolder]: 3787/6254 cut-off events. [2022-12-13 09:19:53,564 INFO L131 PetriNetUnfolder]: For 1610/2129 co-relation queries the response was YES. [2022-12-13 09:19:53,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 6254 events. 3787/6254 cut-off events. For 1610/2129 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 45697 event pairs, 1055 based on Foata normal form. 17/2752 useless extension candidates. Maximal degree in co-relation 17875. Up to 5644 conditions per place. [2022-12-13 09:19:53,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 69 transitions, 323 flow [2022-12-13 09:19:53,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 1572 [2022-12-13 09:19:53,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:19:53,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 348 [2022-12-13 09:19:53,674 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 326 flow [2022-12-13 09:19:53,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:53,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:53,674 INFO L214 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-13 09:19:53,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:19:53,674 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash -100265236, now seen corresponding path program 1 times [2022-12-13 09:19:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:53,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2716101] [2022-12-13 09:19:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:53,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:53,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2716101] [2022-12-13 09:19:53,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2716101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:53,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:53,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:53,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143163188] [2022-12-13 09:19:53,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:53,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:19:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:53,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:19:53,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:19:53,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 09:19:53,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:53,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:53,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 09:19:53,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:54,830 INFO L130 PetriNetUnfolder]: 10008/15105 cut-off events. [2022-12-13 09:19:54,830 INFO L131 PetriNetUnfolder]: For 8698/10307 co-relation queries the response was YES. [2022-12-13 09:19:54,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51156 conditions, 15105 events. 10008/15105 cut-off events. For 8698/10307 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 102356 event pairs, 1056 based on Foata normal form. 918/9879 useless extension candidates. Maximal degree in co-relation 51138. Up to 8947 conditions per place. [2022-12-13 09:19:54,895 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 65 selfloop transitions, 37 changer transitions 0/114 dead transitions. [2022-12-13 09:19:54,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 114 transitions, 704 flow [2022-12-13 09:19:54,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:19:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:19:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 09:19:54,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 09:19:54,897 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 326 flow. Second operand 5 states and 146 transitions. [2022-12-13 09:19:54,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 114 transitions, 704 flow [2022-12-13 09:19:54,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 114 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:19:54,902 INFO L231 Difference]: Finished difference. Result has 65 places, 81 transitions, 520 flow [2022-12-13 09:19:54,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=520, PETRI_PLACES=65, PETRI_TRANSITIONS=81} [2022-12-13 09:19:54,903 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -13 predicate places. [2022-12-13 09:19:54,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:54,903 INFO L89 Accepts]: Start accepts. Operand has 65 places, 81 transitions, 520 flow [2022-12-13 09:19:54,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:54,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:54,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 81 transitions, 520 flow [2022-12-13 09:19:54,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 81 transitions, 520 flow [2022-12-13 09:19:55,100 INFO L130 PetriNetUnfolder]: 2149/4260 cut-off events. [2022-12-13 09:19:55,101 INFO L131 PetriNetUnfolder]: For 2303/2798 co-relation queries the response was YES. [2022-12-13 09:19:55,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16508 conditions, 4260 events. 2149/4260 cut-off events. For 2303/2798 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 35138 event pairs, 200 based on Foata normal form. 17/2094 useless extension candidates. Maximal degree in co-relation 16491. Up to 3547 conditions per place. [2022-12-13 09:19:55,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 81 transitions, 520 flow [2022-12-13 09:19:55,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 1592 [2022-12-13 09:19:55,160 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:55,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 258 [2022-12-13 09:19:55,161 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 81 transitions, 520 flow [2022-12-13 09:19:55,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:55,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:55,161 INFO L214 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-13 09:19:55,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:19:55,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 453732730, now seen corresponding path program 1 times [2022-12-13 09:19:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:55,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423973808] [2022-12-13 09:19:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:55,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:55,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423973808] [2022-12-13 09:19:55,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423973808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:55,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:55,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:55,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111128217] [2022-12-13 09:19:55,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:55,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:55,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:55,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 09:19:55,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 81 transitions, 520 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:55,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:55,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 09:19:55,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:57,064 INFO L130 PetriNetUnfolder]: 16215/25719 cut-off events. [2022-12-13 09:19:57,065 INFO L131 PetriNetUnfolder]: For 35743/38845 co-relation queries the response was YES. [2022-12-13 09:19:57,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103584 conditions, 25719 events. 16215/25719 cut-off events. For 35743/38845 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 191937 event pairs, 1132 based on Foata normal form. 1713/22166 useless extension candidates. Maximal degree in co-relation 103564. Up to 14467 conditions per place. [2022-12-13 09:19:57,156 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 128 selfloop transitions, 15 changer transitions 8/172 dead transitions. [2022-12-13 09:19:57,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 172 transitions, 1385 flow [2022-12-13 09:19:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:19:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:19:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2022-12-13 09:19:57,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 09:19:57,157 INFO L175 Difference]: Start difference. First operand has 65 places, 81 transitions, 520 flow. Second operand 5 states and 130 transitions. [2022-12-13 09:19:57,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 172 transitions, 1385 flow [2022-12-13 09:19:57,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 172 transitions, 1175 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:57,504 INFO L231 Difference]: Finished difference. Result has 68 places, 89 transitions, 517 flow [2022-12-13 09:19:57,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=68, PETRI_TRANSITIONS=89} [2022-12-13 09:19:57,505 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2022-12-13 09:19:57,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:57,505 INFO L89 Accepts]: Start accepts. Operand has 68 places, 89 transitions, 517 flow [2022-12-13 09:19:57,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:57,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:57,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 89 transitions, 517 flow [2022-12-13 09:19:57,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 89 transitions, 517 flow [2022-12-13 09:19:57,938 INFO L130 PetriNetUnfolder]: 4889/9762 cut-off events. [2022-12-13 09:19:57,938 INFO L131 PetriNetUnfolder]: For 8633/14704 co-relation queries the response was YES. [2022-12-13 09:19:57,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29902 conditions, 9762 events. 4889/9762 cut-off events. For 8633/14704 co-relation queries the response was YES. Maximal size of possible extension queue 1296. Compared 91678 event pairs, 466 based on Foata normal form. 54/4765 useless extension candidates. Maximal degree in co-relation 29883. Up to 6508 conditions per place. [2022-12-13 09:19:58,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 89 transitions, 517 flow [2022-12-13 09:19:58,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 1922 [2022-12-13 09:19:58,088 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:58,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 583 [2022-12-13 09:19:58,089 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 89 transitions, 517 flow [2022-12-13 09:19:58,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:58,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:58,089 INFO L214 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-13 09:19:58,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:19:58,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:19:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1694426744, now seen corresponding path program 2 times [2022-12-13 09:19:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:58,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957281179] [2022-12-13 09:19:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:58,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:58,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957281179] [2022-12-13 09:19:58,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957281179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:58,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:58,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:19:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535288960] [2022-12-13 09:19:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:58,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:19:58,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:19:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:19:58,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2022-12-13 09:19:58,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 89 transitions, 517 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:58,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:58,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2022-12-13 09:19:58,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:01,953 INFO L130 PetriNetUnfolder]: 25664/43665 cut-off events. [2022-12-13 09:20:01,954 INFO L131 PetriNetUnfolder]: For 66474/70463 co-relation queries the response was YES. [2022-12-13 09:20:02,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162541 conditions, 43665 events. 25664/43665 cut-off events. For 66474/70463 co-relation queries the response was YES. Maximal size of possible extension queue 3580. Compared 409452 event pairs, 2905 based on Foata normal form. 1790/34814 useless extension candidates. Maximal degree in co-relation 162519. Up to 24208 conditions per place. [2022-12-13 09:20:02,171 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 178 selfloop transitions, 21 changer transitions 20/250 dead transitions. [2022-12-13 09:20:02,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 250 transitions, 1916 flow [2022-12-13 09:20:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 09:20:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 09:20:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2022-12-13 09:20:02,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 09:20:02,173 INFO L175 Difference]: Start difference. First operand has 68 places, 89 transitions, 517 flow. Second operand 9 states and 225 transitions. [2022-12-13 09:20:02,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 250 transitions, 1916 flow [2022-12-13 09:20:02,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 250 transitions, 1916 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:20:02,682 INFO L231 Difference]: Finished difference. Result has 79 places, 108 transitions, 707 flow [2022-12-13 09:20:02,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=707, PETRI_PLACES=79, PETRI_TRANSITIONS=108} [2022-12-13 09:20:02,683 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2022-12-13 09:20:02,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:02,683 INFO L89 Accepts]: Start accepts. Operand has 79 places, 108 transitions, 707 flow [2022-12-13 09:20:02,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:02,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:02,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 108 transitions, 707 flow [2022-12-13 09:20:02,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 108 transitions, 707 flow [2022-12-13 09:20:04,227 INFO L130 PetriNetUnfolder]: 13030/24545 cut-off events. [2022-12-13 09:20:04,227 INFO L131 PetriNetUnfolder]: For 24837/31638 co-relation queries the response was YES. [2022-12-13 09:20:04,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80790 conditions, 24545 events. 13030/24545 cut-off events. For 24837/31638 co-relation queries the response was YES. Maximal size of possible extension queue 3621. Compared 257716 event pairs, 1146 based on Foata normal form. 83/12225 useless extension candidates. Maximal degree in co-relation 80766. Up to 17200 conditions per place. [2022-12-13 09:20:04,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 108 transitions, 707 flow [2022-12-13 09:20:04,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 2394 [2022-12-13 09:20:04,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L2-1-->L889: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_30 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_32 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse2 (and .cse4 (not (= 0 (mod v_~z$w_buff1_used~0_127 256))))) (.cse1 (and .cse3 .cse5))) (and (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z$r_buff0_thd0~0_31 (ite .cse1 0 v_~z$r_buff0_thd0~0_32)) (= v_~z~0_106 (ite .cse0 v_~z$w_buff0~0_76 (ite .cse2 v_~z$w_buff1~0_71 v_~z~0_107))) (= v_~z$r_buff1_thd0~0_29 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_31 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_126 256) 0)))) 0 v_~z$r_buff1_thd0~0_30)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_127) v_~z$w_buff1_used~0_126)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_30, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_107} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_126, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_106} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [404] L828-->L844: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_63 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse3 (and .cse10 .cse6))) (let ((.cse4 (or .cse1 .cse11 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_111 0))) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p3_EAX~0_14) v_~z~0_94) (= v_~z$mem_tmp~0_30 v_~z~0_95) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_1| v_~weak$$choice0~0_14) (= v_~z$w_buff0~0_59 v_~z$w_buff0~0_58) (= v_~__unbuffered_p3_EAX~0_14 (ite .cse4 v_~z~0_95 (ite .cse5 v_~z$w_buff0~0_59 v_~z$w_buff1~0_58))) (= v_~z$r_buff0_thd4~0_62 (ite .cse0 v_~z$r_buff0_thd4~0_63 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~z$r_buff0_thd4~0_63 (ite (and (not .cse2) .cse8) 0 v_~z$r_buff0_thd4~0_63)))) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse4 v_~z$w_buff0_used~0_124 (ite .cse5 0 v_~z$w_buff0_used~0_124)))) (= v_~z$r_buff1_thd4~0_59 (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd4~0_62 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse7) .cse2)) v_~z$r_buff1_thd4~0_60 0))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_59, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$w_buff1~0=v_~z$w_buff1~0_58, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_62, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-13 09:20:04,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L2-1-->L889: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_30 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_32 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse2 (and .cse4 (not (= 0 (mod v_~z$w_buff1_used~0_127 256))))) (.cse1 (and .cse3 .cse5))) (and (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z$r_buff0_thd0~0_31 (ite .cse1 0 v_~z$r_buff0_thd0~0_32)) (= v_~z~0_106 (ite .cse0 v_~z$w_buff0~0_76 (ite .cse2 v_~z$w_buff1~0_71 v_~z~0_107))) (= v_~z$r_buff1_thd0~0_29 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_31 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_126 256) 0)))) 0 v_~z$r_buff1_thd0~0_30)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_127) v_~z$w_buff1_used~0_126)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_30, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_107} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_126, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_106} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [404] L828-->L844: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_63 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse3 (and .cse10 .cse6))) (let ((.cse4 (or .cse1 .cse11 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_111 0))) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p3_EAX~0_14) v_~z~0_94) (= v_~z$mem_tmp~0_30 v_~z~0_95) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_1| v_~weak$$choice0~0_14) (= v_~z$w_buff0~0_59 v_~z$w_buff0~0_58) (= v_~__unbuffered_p3_EAX~0_14 (ite .cse4 v_~z~0_95 (ite .cse5 v_~z$w_buff0~0_59 v_~z$w_buff1~0_58))) (= v_~z$r_buff0_thd4~0_62 (ite .cse0 v_~z$r_buff0_thd4~0_63 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~z$r_buff0_thd4~0_63 (ite (and (not .cse2) .cse8) 0 v_~z$r_buff0_thd4~0_63)))) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse4 v_~z$w_buff0_used~0_124 (ite .cse5 0 v_~z$w_buff0_used~0_124)))) (= v_~z$r_buff1_thd4~0_59 (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd4~0_62 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse7) .cse2)) v_~z$r_buff1_thd4~0_60 0))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_59, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$w_buff1~0=v_~z$w_buff1~0_58, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_62, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] [2022-12-13 09:20:05,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [562] L2-1-->L844: Formula: (let ((.cse21 (not (= (mod v_~z$r_buff0_thd0~0_181 256) 0)))) (let ((.cse18 (and (not (= (mod v_~z$w_buff0_used~0_395 256) 0)) .cse21))) (let ((.cse1 (ite .cse18 0 v_~z$w_buff0_used~0_395))) (let ((.cse20 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse20)) (.cse5 (not (= (mod v_~z$r_buff1_thd0~0_183 256) 0)))) (let ((.cse19 (and (not (= (mod v_~z$w_buff1_used~0_349 256) 0)) .cse5)) (.cse17 (and .cse6 .cse21))) (let ((.cse12 (ite (or .cse19 .cse17) 0 v_~z$w_buff1_used~0_349))) (let ((.cse8 (= (mod v_~z$r_buff1_thd4~0_153 256) 0)) (.cse4 (= (mod .cse12 256) 0)) (.cse15 (= (mod v_~z$r_buff0_thd4~0_189 256) 0))) (let ((.cse16 (not .cse15)) (.cse13 (and .cse15 .cse4)) (.cse14 (and .cse15 .cse8))) (let ((.cse2 (or .cse13 .cse20 .cse14)) (.cse3 (and .cse16 .cse6)) (.cse11 (ite .cse18 v_~z$w_buff0~0_251 (ite .cse19 v_~z$w_buff1~0_226 v_~z~0_321))) (.cse0 (not (= (mod v_~weak$$choice2~0_131 256) 0))) (.cse10 (= (mod v_~z$w_buff1_used~0_347 256) 0)) (.cse9 (= (mod v_~z$w_buff0_used~0_393 256) 0))) (and (= v_~z$w_buff0_used~0_393 (ite .cse0 .cse1 (ite .cse2 .cse1 (ite .cse3 0 .cse1)))) (= v_~z$flush_delayed~0_117 0) (= v_~z$r_buff1_thd0~0_182 (ite (or (and (not .cse4) .cse5) (and .cse6 (not (= (mod v_~z$r_buff0_thd0~0_180 256) 0)))) 0 v_~z$r_buff1_thd0~0_183)) (= v_~z$w_buff1~0_225 v_~z$w_buff1~0_226) (= (ite .cse0 v_~z$r_buff1_thd4~0_153 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd4~0_188 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) v_~z$r_buff1_thd4~0_153 0)) v_~z$r_buff1_thd4~0_152) (= v_~z~0_319 (ite .cse0 v_~z$mem_tmp~0_95 v_~__unbuffered_p3_EAX~0_180)) (= v_~__unbuffered_p3_EAX~0_180 (ite .cse2 .cse11 (ite .cse3 v_~z$w_buff0~0_251 v_~z$w_buff1~0_226))) (= (ite .cse0 .cse12 (ite (or .cse9 .cse13 .cse14) .cse12 0)) v_~z$w_buff1_used~0_347) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_26| v_~weak$$choice0~0_81) (= v_~z$w_buff0~0_251 v_~z$w_buff0~0_250) (= .cse11 v_~z$mem_tmp~0_95) (= (ite .cse0 v_~z$r_buff0_thd4~0_189 (ite (or .cse9 .cse14 (and .cse15 .cse10)) v_~z$r_buff0_thd4~0_189 (ite (and .cse16 (not .cse9)) 0 v_~z$r_buff0_thd4~0_189))) v_~z$r_buff0_thd4~0_188) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_26| v_~weak$$choice2~0_131) (= v_~z$r_buff0_thd0~0_180 (ite .cse17 0 v_~z$r_buff0_thd0~0_181))))))))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_26|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_153, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_395, ~z$w_buff0~0=v_~z$w_buff0~0_251, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_349, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_189, ~z$w_buff1~0=v_~z$w_buff1~0_226, ~z~0=v_~z~0_321, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_26|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_95, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_152, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_393, ~z$w_buff0~0=v_~z$w_buff0~0_250, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_347, ~z$w_buff1~0=v_~z$w_buff1~0_225, ~z$flush_delayed~0=v_~z$flush_delayed~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_81, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_180, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_180, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_188, ~z~0=v_~z~0_319, ~weak$$choice2~0=v_~weak$$choice2~0_131} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] and [391] L775-->L778: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-13 09:20:05,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L790-->L806: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd3~0_54 256) 0))) (let ((.cse7 (not .cse6)) (.cse10 (and .cse6 (= (mod v_~z$w_buff1_used~0_119 256) 0))) (.cse5 (and .cse4 .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse8 (or .cse10 .cse5 .cse11)) (.cse9 (and .cse7 (not .cse11)))) (and (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_53 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_16) (= v_~z$r_buff0_thd3~0_53 (ite .cse0 v_~z$r_buff0_thd3~0_54 (ite (or .cse1 .cse5 (and .cse6 .cse3)) v_~z$r_buff0_thd3~0_54 (ite (and .cse7 (not .cse1)) 0 v_~z$r_buff0_thd3~0_54)))) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z~0_102 (ite .cse0 v_~z$mem_tmp~0_32 v_~__unbuffered_p2_EAX~0_18)) (= (ite .cse8 v_~z~0_103 (ite .cse9 v_~z$w_buff0~0_65 v_~z$w_buff1~0_64)) v_~__unbuffered_p2_EAX~0_18) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse1 .cse10 .cse5) v_~z$w_buff1_used~0_119 0))) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_66) (= v_~z$mem_tmp~0_32 v_~z~0_103) (= v_~z$flush_delayed~0_52 0) (= v_~z$w_buff0~0_65 v_~z$w_buff0~0_64) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse8 v_~z$w_buff0_used~0_132 (ite .cse9 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_65, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~z$w_buff1~0=v_~z$w_buff1~0_64, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z~0=v_~z~0_103} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] and [391] L775-->L778: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-13 09:20:05,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [563] L2-1-->L844: Formula: (let ((.cse21 (not (= (mod v_~z$r_buff0_thd0~0_185 256) 0)))) (let ((.cse18 (and .cse21 (not (= (mod v_~z$w_buff0_used~0_401 256) 0))))) (let ((.cse11 (ite .cse18 0 v_~z$w_buff0_used~0_401))) (let ((.cse20 (= (mod .cse11 256) 0))) (let ((.cse13 (not (= (mod v_~z$r_buff1_thd0~0_187 256) 0))) (.cse12 (not .cse20))) (let ((.cse15 (and .cse21 .cse12)) (.cse19 (and .cse13 (not (= (mod v_~z$w_buff1_used~0_355 256) 0))))) (let ((.cse1 (ite (or .cse15 .cse19) 0 v_~z$w_buff1_used~0_355))) (let ((.cse9 (= (mod v_~z$r_buff1_thd4~0_157 256) 0)) (.cse14 (= (mod .cse1 256) 0)) (.cse16 (= (mod v_~z$r_buff0_thd4~0_193 256) 0))) (let ((.cse17 (not .cse16)) (.cse2 (and .cse16 .cse14)) (.cse4 (and .cse16 .cse9))) (let ((.cse5 (or .cse2 .cse20 .cse4)) (.cse7 (and .cse17 .cse12)) (.cse0 (not (= (mod v_~weak$$choice2~0_133 256) 0))) (.cse10 (= (mod v_~z$w_buff1_used~0_353 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_399 256) 0)) (.cse6 (ite .cse18 v_~z$w_buff0~0_255 (ite .cse19 v_~z$w_buff1~0_230 v_~z~0_327)))) (and (= v_~z$w_buff1~0_229 v_~z$w_buff1~0_230) (= (ite .cse0 .cse1 (ite (or .cse2 .cse3 .cse4) .cse1 0)) v_~z$w_buff1_used~0_353) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_30| v_~weak$$choice0~0_83) (= v_~__unbuffered_p3_EAX~0_182 (ite .cse5 .cse6 (ite .cse7 v_~z$w_buff0~0_255 v_~z$w_buff1~0_230))) (= (ite .cse0 v_~z$r_buff1_thd4~0_157 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd4~0_192 256) 0))) (or (and .cse8 .cse9) .cse3 (and .cse10 .cse8))) v_~z$r_buff1_thd4~0_157 0)) v_~z$r_buff1_thd4~0_156) (= v_~z$w_buff0_used~0_399 (ite .cse0 .cse11 (ite .cse5 .cse11 (ite .cse7 0 .cse11)))) (= v_~z$flush_delayed~0_119 0) (= v_~z$r_buff1_thd0~0_186 (ite (or (and .cse12 (not (= (mod v_~z$r_buff0_thd0~0_184 256) 0))) (and .cse13 (not .cse14))) 0 v_~z$r_buff1_thd0~0_187)) (= v_~z$r_buff0_thd0~0_184 (ite .cse15 0 v_~z$r_buff0_thd0~0_185)) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_30| v_~weak$$choice2~0_133) (= (ite .cse0 v_~z$mem_tmp~0_97 v_~__unbuffered_p3_EAX~0_182) v_~z~0_325) (= (ite .cse0 v_~z$r_buff0_thd4~0_193 (ite (or (and .cse10 .cse16) .cse3 .cse4) v_~z$r_buff0_thd4~0_193 (ite (and .cse17 (not .cse3)) 0 v_~z$r_buff0_thd4~0_193))) v_~z$r_buff0_thd4~0_192) (= v_~z$mem_tmp~0_97 .cse6) (= v_~z$w_buff0~0_255 v_~z$w_buff0~0_254)))))))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_30|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_185, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_157, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_401, ~z$w_buff0~0=v_~z$w_buff0~0_255, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_187, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_355, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_230, ~z~0=v_~z~0_327, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_30|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_97, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_156, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_254, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_353, ~z$w_buff1~0=v_~z$w_buff1~0_229, ~z$flush_delayed~0=v_~z$flush_delayed~0_119, ~weak$$choice0~0=v_~weak$$choice0~0_83, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_184, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_186, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_182, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_192, ~z~0=v_~z~0_325, ~weak$$choice2~0=v_~weak$$choice2~0_133} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~z$r_buff1_thd0~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0] and [525] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~__unbuffered_p0_EAX~0_43 0) (= v_~__unbuffered_p1_EAX~0_38 1) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~__unbuffered_p3_EAX~0_50 1) (= v_~__unbuffered_p2_EAX~0_54 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_36) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0] [2022-12-13 09:20:05,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L2-1-->L889: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_30 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_32 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse2 (and .cse4 (not (= 0 (mod v_~z$w_buff1_used~0_127 256))))) (.cse1 (and .cse3 .cse5))) (and (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z$r_buff0_thd0~0_31 (ite .cse1 0 v_~z$r_buff0_thd0~0_32)) (= v_~z~0_106 (ite .cse0 v_~z$w_buff0~0_76 (ite .cse2 v_~z$w_buff1~0_71 v_~z~0_107))) (= v_~z$r_buff1_thd0~0_29 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_31 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_126 256) 0)))) 0 v_~z$r_buff1_thd0~0_30)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_127) v_~z$w_buff1_used~0_126)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_30, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_107} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_76, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_126, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_106} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [429] $Ultimate##0-->L828: Formula: (and (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff1_thd3~0_61) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_157 256) 0)) (not (= (mod v_~z$w_buff1_used~0_138 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_157 1) (= v_~z$w_buff0~0_86 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_87 v_~z$w_buff1~0_79) (= v_~z$r_buff0_thd4~0_82 1) (= v_~z$r_buff0_thd0~0_39 v_~z$r_buff1_thd0~0_37) (= v_~z$r_buff0_thd4~0_83 v_~z$r_buff1_thd4~0_73) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_138) (= v_~z$r_buff0_thd1~0_15 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd2~0_17 v_~z$r_buff1_thd2~0_17)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_87, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_86, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_79, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_37, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-13 09:20:07,663 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:20:07,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4982 [2022-12-13 09:20:07,665 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 106 transitions, 740 flow [2022-12-13 09:20:07,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:07,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:07,665 INFO L214 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-13 09:20:07,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:20:07,665 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1026891008, now seen corresponding path program 3 times [2022-12-13 09:20:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:07,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034809638] [2022-12-13 09:20:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:07,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034809638] [2022-12-13 09:20:07,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034809638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:07,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:07,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:20:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175775109] [2022-12-13 09:20:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:07,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:20:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:20:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:20:07,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2022-12-13 09:20:07,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 106 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:07,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:07,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2022-12-13 09:20:07,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:09,906 INFO L130 PetriNetUnfolder]: 19818/30934 cut-off events. [2022-12-13 09:20:09,906 INFO L131 PetriNetUnfolder]: For 46764/51338 co-relation queries the response was YES. [2022-12-13 09:20:10,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118838 conditions, 30934 events. 19818/30934 cut-off events. For 46764/51338 co-relation queries the response was YES. Maximal size of possible extension queue 2010. Compared 244302 event pairs, 301 based on Foata normal form. 3221/18939 useless extension candidates. Maximal degree in co-relation 118811. Up to 14446 conditions per place. [2022-12-13 09:20:10,069 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 84 selfloop transitions, 49 changer transitions 14/160 dead transitions. [2022-12-13 09:20:10,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 160 transitions, 1351 flow [2022-12-13 09:20:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:20:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:20:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-13 09:20:10,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2022-12-13 09:20:10,070 INFO L175 Difference]: Start difference. First operand has 77 places, 106 transitions, 740 flow. Second operand 6 states and 159 transitions. [2022-12-13 09:20:10,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 160 transitions, 1351 flow [2022-12-13 09:20:11,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 160 transitions, 1318 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 09:20:11,530 INFO L231 Difference]: Finished difference. Result has 80 places, 94 transitions, 695 flow [2022-12-13 09:20:11,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=695, PETRI_PLACES=80, PETRI_TRANSITIONS=94} [2022-12-13 09:20:11,531 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2022-12-13 09:20:11,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:11,531 INFO L89 Accepts]: Start accepts. Operand has 80 places, 94 transitions, 695 flow [2022-12-13 09:20:11,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:11,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:11,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 94 transitions, 695 flow [2022-12-13 09:20:11,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 94 transitions, 695 flow [2022-12-13 09:20:11,907 INFO L130 PetriNetUnfolder]: 3191/5972 cut-off events. [2022-12-13 09:20:11,908 INFO L131 PetriNetUnfolder]: For 4612/9934 co-relation queries the response was YES. [2022-12-13 09:20:11,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23544 conditions, 5972 events. 3191/5972 cut-off events. For 4612/9934 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 49443 event pairs, 15 based on Foata normal form. 3/2291 useless extension candidates. Maximal degree in co-relation 23520. Up to 3970 conditions per place. [2022-12-13 09:20:11,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 94 transitions, 695 flow [2022-12-13 09:20:11,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 1858 [2022-12-13 09:20:12,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] $Ultimate##0-->L828: Formula: (and (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff1_thd3~0_61) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_157 256) 0)) (not (= (mod v_~z$w_buff1_used~0_138 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_157 1) (= v_~z$w_buff0~0_86 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_87 v_~z$w_buff1~0_79) (= v_~z$r_buff0_thd4~0_82 1) (= v_~z$r_buff0_thd0~0_39 v_~z$r_buff1_thd0~0_37) (= v_~z$r_buff0_thd4~0_83 v_~z$r_buff1_thd4~0_73) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_138) (= v_~z$r_buff0_thd1~0_15 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd2~0_17 v_~z$r_buff1_thd2~0_17)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_87, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_86, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_79, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_37, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] and [397] L790-->L806: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd3~0_54 256) 0))) (let ((.cse7 (not .cse6)) (.cse10 (and .cse6 (= (mod v_~z$w_buff1_used~0_119 256) 0))) (.cse5 (and .cse4 .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse8 (or .cse10 .cse5 .cse11)) (.cse9 (and .cse7 (not .cse11)))) (and (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_53 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_16) (= v_~z$r_buff0_thd3~0_53 (ite .cse0 v_~z$r_buff0_thd3~0_54 (ite (or .cse1 .cse5 (and .cse6 .cse3)) v_~z$r_buff0_thd3~0_54 (ite (and .cse7 (not .cse1)) 0 v_~z$r_buff0_thd3~0_54)))) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z~0_102 (ite .cse0 v_~z$mem_tmp~0_32 v_~__unbuffered_p2_EAX~0_18)) (= (ite .cse8 v_~z~0_103 (ite .cse9 v_~z$w_buff0~0_65 v_~z$w_buff1~0_64)) v_~__unbuffered_p2_EAX~0_18) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse1 .cse10 .cse5) v_~z$w_buff1_used~0_119 0))) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_66) (= v_~z$mem_tmp~0_32 v_~z~0_103) (= v_~z$flush_delayed~0_52 0) (= v_~z$w_buff0~0_65 v_~z$w_buff0~0_64) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse8 v_~z$w_buff0_used~0_132 (ite .cse9 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_65, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~z$w_buff1~0=v_~z$w_buff1~0_64, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z~0=v_~z~0_103} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] [2022-12-13 09:20:12,335 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] $Ultimate##0-->L828: Formula: (and (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff1_thd3~0_61) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_157 256) 0)) (not (= (mod v_~z$w_buff1_used~0_138 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_157 1) (= v_~z$w_buff0~0_86 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_87 v_~z$w_buff1~0_79) (= v_~z$r_buff0_thd4~0_82 1) (= v_~z$r_buff0_thd0~0_39 v_~z$r_buff1_thd0~0_37) (= v_~z$r_buff0_thd4~0_83 v_~z$r_buff1_thd4~0_73) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_138) (= v_~z$r_buff0_thd1~0_15 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd2~0_17 v_~z$r_buff1_thd2~0_17)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_87, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_86, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_79, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_37, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] and [397] L790-->L806: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd3~0_54 256) 0))) (let ((.cse7 (not .cse6)) (.cse10 (and .cse6 (= (mod v_~z$w_buff1_used~0_119 256) 0))) (.cse5 (and .cse4 .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse8 (or .cse10 .cse5 .cse11)) (.cse9 (and .cse7 (not .cse11)))) (and (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_53 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_16) (= v_~z$r_buff0_thd3~0_53 (ite .cse0 v_~z$r_buff0_thd3~0_54 (ite (or .cse1 .cse5 (and .cse6 .cse3)) v_~z$r_buff0_thd3~0_54 (ite (and .cse7 (not .cse1)) 0 v_~z$r_buff0_thd3~0_54)))) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z~0_102 (ite .cse0 v_~z$mem_tmp~0_32 v_~__unbuffered_p2_EAX~0_18)) (= (ite .cse8 v_~z~0_103 (ite .cse9 v_~z$w_buff0~0_65 v_~z$w_buff1~0_64)) v_~__unbuffered_p2_EAX~0_18) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse1 .cse10 .cse5) v_~z$w_buff1_used~0_119 0))) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_66) (= v_~z$mem_tmp~0_32 v_~z~0_103) (= v_~z$flush_delayed~0_52 0) (= v_~z$w_buff0~0_65 v_~z$w_buff0~0_64) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse8 v_~z$w_buff0_used~0_132 (ite .cse9 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_65, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~z$w_buff1~0=v_~z$w_buff1~0_64, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z~0=v_~z~0_103} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] [2022-12-13 09:20:12,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] $Ultimate##0-->L828: Formula: (and (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff1_thd3~0_61) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_157 256) 0)) (not (= (mod v_~z$w_buff1_used~0_138 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_157 1) (= v_~z$w_buff0~0_86 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_87 v_~z$w_buff1~0_79) (= v_~z$r_buff0_thd4~0_82 1) (= v_~z$r_buff0_thd0~0_39 v_~z$r_buff1_thd0~0_37) (= v_~z$r_buff0_thd4~0_83 v_~z$r_buff1_thd4~0_73) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_138) (= v_~z$r_buff0_thd1~0_15 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd2~0_17 v_~z$r_buff1_thd2~0_17)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_87, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_86, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_138, ~z$w_buff1~0=v_~z$w_buff1~0_79, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_39, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_37, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_17} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] and [397] L790-->L806: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd3~0_54 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd3~0_54 256) 0))) (let ((.cse7 (not .cse6)) (.cse10 (and .cse6 (= (mod v_~z$w_buff1_used~0_119 256) 0))) (.cse5 (and .cse4 .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_132 256) 0))) (let ((.cse3 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_131 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse8 (or .cse10 .cse5 .cse11)) (.cse9 (and .cse7 (not .cse11)))) (and (= (ite .cse0 v_~z$r_buff1_thd3~0_54 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_53 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~z$r_buff1_thd3~0_54 0)) v_~z$r_buff1_thd3~0_53) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_16) (= v_~z$r_buff0_thd3~0_53 (ite .cse0 v_~z$r_buff0_thd3~0_54 (ite (or .cse1 .cse5 (and .cse6 .cse3)) v_~z$r_buff0_thd3~0_54 (ite (and .cse7 (not .cse1)) 0 v_~z$r_buff0_thd3~0_54)))) (= v_~z$w_buff1~0_64 v_~z$w_buff1~0_63) (= v_~z~0_102 (ite .cse0 v_~z$mem_tmp~0_32 v_~__unbuffered_p2_EAX~0_18)) (= (ite .cse8 v_~z~0_103 (ite .cse9 v_~z$w_buff0~0_65 v_~z$w_buff1~0_64)) v_~__unbuffered_p2_EAX~0_18) (= v_~z$w_buff1_used~0_118 (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse1 .cse10 .cse5) v_~z$w_buff1_used~0_119 0))) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_66) (= v_~z$mem_tmp~0_32 v_~z~0_103) (= v_~z$flush_delayed~0_52 0) (= v_~z$w_buff0~0_65 v_~z$w_buff0~0_64) (= v_~z$w_buff0_used~0_131 (ite .cse0 v_~z$w_buff0_used~0_132 (ite .cse8 v_~z$w_buff0_used~0_132 (ite .cse9 0 v_~z$w_buff0_used~0_132)))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_65, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~z$w_buff1~0=v_~z$w_buff1~0_64, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z~0=v_~z~0_103} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_64, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~z~0=v_~z~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] [2022-12-13 09:20:14,350 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:20:14,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2820 [2022-12-13 09:20:14,351 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 90 transitions, 709 flow [2022-12-13 09:20:14,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:14,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:14,351 INFO L214 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-13 09:20:14,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:20:14,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash 637844276, now seen corresponding path program 1 times [2022-12-13 09:20:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:14,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018686602] [2022-12-13 09:20:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018686602] [2022-12-13 09:20:14,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018686602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:14,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:14,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043446328] [2022-12-13 09:20:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:14,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:14,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:20:14,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 90 transitions, 709 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:14,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:14,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:20:14,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:15,467 INFO L130 PetriNetUnfolder]: 10701/16593 cut-off events. [2022-12-13 09:20:15,467 INFO L131 PetriNetUnfolder]: For 38394/40026 co-relation queries the response was YES. [2022-12-13 09:20:15,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73704 conditions, 16593 events. 10701/16593 cut-off events. For 38394/40026 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 123170 event pairs, 903 based on Foata normal form. 599/12305 useless extension candidates. Maximal degree in co-relation 73677. Up to 8275 conditions per place. [2022-12-13 09:20:15,522 INFO L137 encePairwiseOnDemand]: 39/43 looper letters, 53 selfloop transitions, 1 changer transitions 90/168 dead transitions. [2022-12-13 09:20:15,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 168 transitions, 1590 flow [2022-12-13 09:20:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:20:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:20:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 09:20:15,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2022-12-13 09:20:15,524 INFO L175 Difference]: Start difference. First operand has 75 places, 90 transitions, 709 flow. Second operand 4 states and 112 transitions. [2022-12-13 09:20:15,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 168 transitions, 1590 flow [2022-12-13 09:20:17,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 168 transitions, 1276 flow, removed 81 selfloop flow, removed 6 redundant places. [2022-12-13 09:20:17,258 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 414 flow [2022-12-13 09:20:17,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2022-12-13 09:20:17,259 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2022-12-13 09:20:17,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:17,259 INFO L89 Accepts]: Start accepts. Operand has 73 places, 76 transitions, 414 flow [2022-12-13 09:20:17,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:17,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:17,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 76 transitions, 414 flow [2022-12-13 09:20:17,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 76 transitions, 414 flow [2022-12-13 09:20:17,461 INFO L130 PetriNetUnfolder]: 1652/2808 cut-off events. [2022-12-13 09:20:17,461 INFO L131 PetriNetUnfolder]: For 2696/2752 co-relation queries the response was YES. [2022-12-13 09:20:17,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 2808 events. 1652/2808 cut-off events. For 2696/2752 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 18577 event pairs, 9 based on Foata normal form. 9/960 useless extension candidates. Maximal degree in co-relation 8179. Up to 1297 conditions per place. [2022-12-13 09:20:17,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 76 transitions, 414 flow [2022-12-13 09:20:17,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 870 [2022-12-13 09:20:17,520 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:20:17,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-13 09:20:17,521 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 416 flow [2022-12-13 09:20:17,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:17,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:17,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:17,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:20:17,521 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1151231230, now seen corresponding path program 1 times [2022-12-13 09:20:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427259055] [2022-12-13 09:20:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427259055] [2022-12-13 09:20:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427259055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:17,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:17,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520279540] [2022-12-13 09:20:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:17,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:17,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:17,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 09:20:17,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:17,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:17,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 09:20:17,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:17,977 INFO L130 PetriNetUnfolder]: 3566/5678 cut-off events. [2022-12-13 09:20:17,978 INFO L131 PetriNetUnfolder]: For 9799/10025 co-relation queries the response was YES. [2022-12-13 09:20:17,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20605 conditions, 5678 events. 3566/5678 cut-off events. For 9799/10025 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 37179 event pairs, 352 based on Foata normal form. 186/4092 useless extension candidates. Maximal degree in co-relation 20579. Up to 2252 conditions per place. [2022-12-13 09:20:17,996 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 57 selfloop transitions, 1 changer transitions 54/132 dead transitions. [2022-12-13 09:20:17,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 132 transitions, 955 flow [2022-12-13 09:20:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:20:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:20:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 09:20:17,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 09:20:17,998 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 416 flow. Second operand 4 states and 88 transitions. [2022-12-13 09:20:17,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 132 transitions, 955 flow [2022-12-13 09:20:18,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 132 transitions, 945 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 09:20:18,228 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 376 flow [2022-12-13 09:20:18,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2022-12-13 09:20:18,229 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -8 predicate places. [2022-12-13 09:20:18,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:18,229 INFO L89 Accepts]: Start accepts. Operand has 70 places, 69 transitions, 376 flow [2022-12-13 09:20:18,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:18,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:18,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 69 transitions, 376 flow [2022-12-13 09:20:18,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 69 transitions, 376 flow [2022-12-13 09:20:18,287 INFO L130 PetriNetUnfolder]: 862/1513 cut-off events. [2022-12-13 09:20:18,287 INFO L131 PetriNetUnfolder]: For 2237/2266 co-relation queries the response was YES. [2022-12-13 09:20:18,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1513 events. 862/1513 cut-off events. For 2237/2266 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 9292 event pairs, 7 based on Foata normal form. 4/547 useless extension candidates. Maximal degree in co-relation 4630. Up to 730 conditions per place. [2022-12-13 09:20:18,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 69 transitions, 376 flow [2022-12-13 09:20:18,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 09:20:18,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:18,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-13 09:20:18,510 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 374 flow [2022-12-13 09:20:18,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:18,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:18,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:18,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:20:18,510 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash -581713917, now seen corresponding path program 1 times [2022-12-13 09:20:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:18,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949562921] [2022-12-13 09:20:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:20:18,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:20:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:20:18,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:20:18,598 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:20:18,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 09:20:18,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 09:20:18,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 09:20:18,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 09:20:18,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 09:20:18,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 09:20:18,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 09:20:18,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:20:18,603 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:18,607 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:20:18,607 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:20:18,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:20:18 BasicIcfg [2022-12-13 09:20:18,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:20:18,678 INFO L158 Benchmark]: Toolchain (without parser) took 45220.56ms. Allocated memory was 210.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 185.5MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 09:20:18,678 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:20:18,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.99ms. Allocated memory is still 210.8MB. Free memory was 185.0MB in the beginning and 156.2MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 09:20:18,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.47ms. Allocated memory is still 210.8MB. Free memory was 156.2MB in the beginning and 153.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:20:18,679 INFO L158 Benchmark]: Boogie Preprocessor took 24.23ms. Allocated memory is still 210.8MB. Free memory was 153.6MB in the beginning and 151.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:20:18,679 INFO L158 Benchmark]: RCFGBuilder took 512.27ms. Allocated memory is still 210.8MB. Free memory was 151.5MB in the beginning and 112.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-13 09:20:18,679 INFO L158 Benchmark]: TraceAbstraction took 44174.24ms. Allocated memory was 210.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 111.6MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 09:20:18,680 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 463.99ms. Allocated memory is still 210.8MB. Free memory was 185.0MB in the beginning and 156.2MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.47ms. Allocated memory is still 210.8MB. Free memory was 156.2MB in the beginning and 153.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.23ms. Allocated memory is still 210.8MB. Free memory was 153.6MB in the beginning and 151.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 512.27ms. Allocated memory is still 210.8MB. Free memory was 151.5MB in the beginning and 112.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 44174.24ms. Allocated memory was 210.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 111.6MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 138 PlacesBefore, 78 PlacesAfterwards, 127 TransitionsBefore, 65 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 52 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4555, independent: 4340, independent conditional: 4340, independent unconditional: 0, dependent: 215, dependent conditional: 215, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2870, independent: 2798, independent conditional: 0, independent unconditional: 2798, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2870, independent: 2798, independent conditional: 0, independent unconditional: 2798, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2870, independent: 2780, independent conditional: 0, independent unconditional: 2780, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4555, independent: 1542, independent conditional: 1542, independent unconditional: 0, dependent: 143, dependent conditional: 143, dependent unconditional: 0, unknown: 2870, unknown conditional: 2870, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2870, Positive cache size: 2798, Positive conditional cache size: 2798, Positive unconditional cache size: 0, Negative cache size: 72, Negative conditional cache size: 72, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 513, independent: 469, independent conditional: 469, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 396, independent: 364, independent conditional: 12, independent unconditional: 352, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 396, independent: 364, independent conditional: 12, independent unconditional: 352, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 396, independent: 310, independent conditional: 0, independent unconditional: 310, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 119, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 81, dependent conditional: 13, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 513, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 396, unknown conditional: 396, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 364, Positive conditional cache size: 364, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 296, independent conditional: 296, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 67, independent conditional: 12, independent unconditional: 55, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, independent: 67, independent conditional: 12, independent unconditional: 55, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 72, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 25, dependent conditional: 23, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 321, independent: 229, independent conditional: 229, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 72, unknown conditional: 72, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 431, Positive conditional cache size: 431, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 980 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 309, independent: 272, independent conditional: 272, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 442, Positive conditional cache size: 442, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 976 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 309, independent: 267, independent conditional: 267, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 458, Positive conditional cache size: 458, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 390, independent: 366, independent conditional: 366, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 78, independent conditional: 27, independent unconditional: 51, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79, independent: 78, independent conditional: 27, independent unconditional: 51, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 390, independent: 288, independent conditional: 288, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 79, unknown conditional: 79, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 536, Positive conditional cache size: 536, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 346, independent: 316, independent conditional: 316, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 40, independent conditional: 30, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 40, independent conditional: 30, independent unconditional: 10, 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: 43, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 346, independent: 276, independent conditional: 276, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 619, Positive cache size: 576, Positive conditional cache size: 576, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 1572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 564, independent: 502, independent conditional: 502, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 79, independent conditional: 39, independent unconditional: 40, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, independent: 79, independent conditional: 39, independent unconditional: 40, 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: 82, independent: 79, independent conditional: 0, independent unconditional: 79, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 564, independent: 423, independent conditional: 423, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 82, unknown conditional: 82, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 701, Positive cache size: 655, Positive conditional cache size: 655, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 611, independent: 573, independent conditional: 573, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 83, independent conditional: 59, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 85, independent: 83, independent conditional: 59, independent unconditional: 24, 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: 85, independent: 83, independent conditional: 0, independent unconditional: 83, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 611, independent: 490, independent conditional: 490, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 85, unknown conditional: 85, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 786, Positive cache size: 738, Positive conditional cache size: 738, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 440, independent: 417, independent conditional: 417, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 53, independent conditional: 40, independent unconditional: 13, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, independent: 53, independent conditional: 40, independent unconditional: 13, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 440, independent: 364, independent conditional: 364, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 56, unknown conditional: 56, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 842, Positive cache size: 791, Positive conditional cache size: 791, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 79 PlacesBefore, 77 PlacesAfterwards, 108 TransitionsBefore, 106 TransitionsAfterwards, 2394 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 702, independent: 692, independent conditional: 692, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 113, independent conditional: 84, independent unconditional: 29, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 114, independent: 113, independent conditional: 84, independent unconditional: 29, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 114, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 702, independent: 579, independent conditional: 579, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 114, unknown conditional: 114, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 904, Positive conditional cache size: 904, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 79 PlacesBefore, 75 PlacesAfterwards, 94 TransitionsBefore, 90 TransitionsAfterwards, 1858 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 526, independent: 520, independent conditional: 520, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 102, independent conditional: 89, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 102, independent: 102, independent conditional: 89, independent unconditional: 13, 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: 102, independent: 102, independent conditional: 0, independent unconditional: 102, 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: 526, independent: 418, independent conditional: 418, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 102, unknown conditional: 102, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1058, Positive cache size: 1006, Positive conditional cache size: 1006, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 70 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 870 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 62, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 62, independent unconditional: 20, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 82, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 82, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1140, Positive cache size: 1088, Positive conditional cache size: 1088, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 66 PlacesBefore, 65 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 28, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 28, 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: 33, independent: 33, independent conditional: 0, independent unconditional: 33, 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: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1121, Positive conditional cache size: 1121, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t325, ((void *)0), P0, ((void *)0))=-1, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t326, ((void *)0), P1, ((void *)0))=0, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, pthread_create(&t327, ((void *)0), P2, ((void *)0))=1, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, pthread_create(&t328, ((void *)0), P3, ((void *)0))=2, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 [L774] 2 __unbuffered_p1_EAX = x [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 y = 1 [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 874]: 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: 876]: 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: 872]: 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: 878]: 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, 166 locations, 7 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: 44.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1333 IncrementalHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 22 mSDtfsCounter, 1333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=740occurred in iteration=10, 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.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:20:18,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...