/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:33:08,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:33:08,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:33:08,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:33:08,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:33:08,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:33:08,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:33:08,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:33:08,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:33:08,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:33:08,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:33:08,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:33:08,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:33:08,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:33:08,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:33:08,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:33:08,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:33:08,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:33:08,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:33:08,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:33:08,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:33:08,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:33:08,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:33:08,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:33:08,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:33:08,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:33:08,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:33:08,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:33:08,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:33:08,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:33:08,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:33:08,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:33:08,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:33:08,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:33:08,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:33:08,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:33:08,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:33:08,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:33:08,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:33:08,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:33:08,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:33:08,961 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-RepeatedSemanticLbe.epf [2022-12-13 00:33:08,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:33:08,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:33:08,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:33:08,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:33:08,997 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:33:08,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:33:08,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:33:08,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:33:08,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:33:08,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:33:09,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:33:09,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:33:09,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:33:09,000 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:33:09,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:33:09,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:33:09,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:33:09,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:33:09,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:33:09,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:33:09,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:33:09,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:33:09,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:33:09,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:33:09,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:33:09,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:33:09,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:33:09,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:33:09,002 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 00:33:09,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:33:09,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:33:09,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:33:09,338 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:33:09,339 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:33:09,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-12-13 00:33:10,393 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:33:10,670 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:33:10,671 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-12-13 00:33:10,685 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89069d3b1/bc9ce59399154256bc74ad7a93baa367/FLAGce18f00b8 [2022-12-13 00:33:10,698 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89069d3b1/bc9ce59399154256bc74ad7a93baa367 [2022-12-13 00:33:10,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:33:10,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:33:10,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:33:10,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:33:10,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:33:10,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:33:10" (1/1) ... [2022-12-13 00:33:10,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa18579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:10, skipping insertion in model container [2022-12-13 00:33:10,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:33:10" (1/1) ... [2022-12-13 00:33:10,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:33:10,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:33:10,893 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/mix002.opt.i[944,957] [2022-12-13 00:33:11,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:33:11,132 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:33:11,144 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/mix002.opt.i[944,957] [2022-12-13 00:33:11,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:11,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:11,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:33:11,249 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:33:11,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11 WrapperNode [2022-12-13 00:33:11,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:33:11,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:33:11,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:33:11,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:33:11,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,329 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-13 00:33:11,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:33:11,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:33:11,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:33:11,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:33:11,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,360 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:33:11,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:33:11,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:33:11,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:33:11,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (1/1) ... [2022-12-13 00:33:11,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:33:11,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:33:11,421 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 00:33:11,451 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 00:33:11,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:33:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:33:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:33:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:33:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:33:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:33:11,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:33:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:33:11,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:33:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:33:11,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:33:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:33:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:33:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:33:11,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:33:11,470 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 00:33:11,640 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:33:11,642 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:33:11,972 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:33:12,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:33:12,127 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:33:12,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:33:12 BoogieIcfgContainer [2022-12-13 00:33:12,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:33:12,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:33:12,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:33:12,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:33:12,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:33:10" (1/3) ... [2022-12-13 00:33:12,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ee9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:33:12, skipping insertion in model container [2022-12-13 00:33:12,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:11" (2/3) ... [2022-12-13 00:33:12,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ee9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:33:12, skipping insertion in model container [2022-12-13 00:33:12,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:33:12" (3/3) ... [2022-12-13 00:33:12,139 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2022-12-13 00:33:12,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:33:12,161 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:33:12,161 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:33:12,213 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:33:12,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 00:33:12,318 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 00:33:12,318 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:12,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 00:33:12,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 00:33:12,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-13 00:33:12,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:12,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 00:33:12,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-13 00:33:12,415 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 00:33:12,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:12,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 00:33:12,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 00:33:12,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 00:33:17,644 INFO L241 LiptonReduction]: Total number of compositions: 90 [2022-12-13 00:33:17,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:33:17,672 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;@6d002518, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:33:17,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:33:17,687 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-13 00:33:17,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:17,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:17,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:17,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash -673775528, now seen corresponding path program 1 times [2022-12-13 00:33:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:17,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982422467] [2022-12-13 00:33:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:18,098 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 00:33:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982422467] [2022-12-13 00:33:18,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982422467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:18,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:18,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:33:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035124263] [2022-12-13 00:33:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:18,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:33:18,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:33:18,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:33:18,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2022-12-13 00:33:18,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 00:33:18,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:18,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2022-12-13 00:33:18,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:19,672 INFO L130 PetriNetUnfolder]: 9064/14202 cut-off events. [2022-12-13 00:33:19,672 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 00:33:19,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27144 conditions, 14202 events. 9064/14202 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 107814 event pairs, 1064 based on Foata normal form. 0/8135 useless extension candidates. Maximal degree in co-relation 27133. Up to 11126 conditions per place. [2022-12-13 00:33:19,726 INFO L137 encePairwiseOnDemand]: 53/57 looper letters, 31 selfloop transitions, 2 changer transitions 42/87 dead transitions. [2022-12-13 00:33:19,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 333 flow [2022-12-13 00:33:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-12-13 00:33:19,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:33:19,738 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 123 flow. Second operand 3 states and 114 transitions. [2022-12-13 00:33:19,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 333 flow [2022-12-13 00:33:19,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 330 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:33:19,743 INFO L231 Difference]: Finished difference. Result has 64 places, 34 transitions, 78 flow [2022-12-13 00:33:19,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=64, PETRI_TRANSITIONS=34} [2022-12-13 00:33:19,747 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -3 predicate places. [2022-12-13 00:33:19,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:19,748 INFO L89 Accepts]: Start accepts. Operand has 64 places, 34 transitions, 78 flow [2022-12-13 00:33:19,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:19,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:19,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 34 transitions, 78 flow [2022-12-13 00:33:19,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2022-12-13 00:33:19,756 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 00:33:19,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:19,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 84 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:33:19,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2022-12-13 00:33:19,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-13 00:33:19,895 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:19,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 00:33:19,897 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 78 flow [2022-12-13 00:33:19,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 00:33:19,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:19,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:19,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:33:19,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1041793488, now seen corresponding path program 1 times [2022-12-13 00:33:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:19,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277308920] [2022-12-13 00:33:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:20,103 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 00:33:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:20,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277308920] [2022-12-13 00:33:20,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277308920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:20,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:20,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:33:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49264779] [2022-12-13 00:33:20,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:20,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:33:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:33:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:33:20,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 00:33:20,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:20,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:20,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 00:33:20,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:20,704 INFO L130 PetriNetUnfolder]: 3570/5403 cut-off events. [2022-12-13 00:33:20,704 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2022-12-13 00:33:20,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10838 conditions, 5403 events. 3570/5403 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 28189 event pairs, 1572 based on Foata normal form. 0/4208 useless extension candidates. Maximal degree in co-relation 10828. Up to 4974 conditions per place. [2022-12-13 00:33:20,736 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 35 selfloop transitions, 4 changer transitions 2/48 dead transitions. [2022-12-13 00:33:20,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 194 flow [2022-12-13 00:33:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 00:33:20,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2022-12-13 00:33:20,739 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 78 flow. Second operand 3 states and 63 transitions. [2022-12-13 00:33:20,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 194 flow [2022-12-13 00:33:20,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:20,742 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 98 flow [2022-12-13 00:33:20,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-13 00:33:20,743 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2022-12-13 00:33:20,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:20,743 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 98 flow [2022-12-13 00:33:20,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:20,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:20,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 98 flow [2022-12-13 00:33:20,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 98 flow [2022-12-13 00:33:20,758 INFO L130 PetriNetUnfolder]: 14/94 cut-off events. [2022-12-13 00:33:20,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:20,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 94 events. 14/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 377 event pairs, 6 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 127. Up to 29 conditions per place. [2022-12-13 00:33:20,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 98 flow [2022-12-13 00:33:20,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-13 00:33:20,799 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:20,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 00:33:20,801 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 98 flow [2022-12-13 00:33:20,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:20,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:20,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:20,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:33:20,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1867723520, now seen corresponding path program 1 times [2022-12-13 00:33:20,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:20,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468546105] [2022-12-13 00:33:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:20,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:20,942 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 00:33:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:20,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468546105] [2022-12-13 00:33:20,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468546105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:20,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:20,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:33:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531643584] [2022-12-13 00:33:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:20,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:20,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 00:33:20,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 00:33:20,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:20,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 00:33:20,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:21,329 INFO L130 PetriNetUnfolder]: 2591/4004 cut-off events. [2022-12-13 00:33:21,329 INFO L131 PetriNetUnfolder]: For 543/543 co-relation queries the response was YES. [2022-12-13 00:33:21,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8616 conditions, 4004 events. 2591/4004 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20744 event pairs, 916 based on Foata normal form. 86/3390 useless extension candidates. Maximal degree in co-relation 8605. Up to 2828 conditions per place. [2022-12-13 00:33:21,351 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 42 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-12-13 00:33:21,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 226 flow [2022-12-13 00:33:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 00:33:21,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2022-12-13 00:33:21,352 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 98 flow. Second operand 3 states and 64 transitions. [2022-12-13 00:33:21,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 226 flow [2022-12-13 00:33:21,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:33:21,354 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 105 flow [2022-12-13 00:33:21,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-13 00:33:21,355 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2022-12-13 00:33:21,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:21,355 INFO L89 Accepts]: Start accepts. Operand has 45 places, 36 transitions, 105 flow [2022-12-13 00:33:21,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:21,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:21,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 105 flow [2022-12-13 00:33:21,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 105 flow [2022-12-13 00:33:21,363 INFO L130 PetriNetUnfolder]: 9/72 cut-off events. [2022-12-13 00:33:21,364 INFO L131 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2022-12-13 00:33:21,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 72 events. 9/72 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 3 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 106. Up to 21 conditions per place. [2022-12-13 00:33:21,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 105 flow [2022-12-13 00:33:21,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 00:33:21,367 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:21,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 00:33:21,368 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 105 flow [2022-12-13 00:33:21,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 00:33:21,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:21,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:21,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:33:21,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash -978980345, now seen corresponding path program 1 times [2022-12-13 00:33:21,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:21,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544384427] [2022-12-13 00:33:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:21,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:21,481 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 00:33:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:21,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544384427] [2022-12-13 00:33:21,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544384427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:21,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:21,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:33:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511265775] [2022-12-13 00:33:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:21,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:21,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:21,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:21,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 00:33:21,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 00:33:21,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:21,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 00:33:21,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:21,831 INFO L130 PetriNetUnfolder]: 2372/3675 cut-off events. [2022-12-13 00:33:21,832 INFO L131 PetriNetUnfolder]: For 1120/1120 co-relation queries the response was YES. [2022-12-13 00:33:21,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8236 conditions, 3675 events. 2372/3675 cut-off events. For 1120/1120 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 18286 event pairs, 1633 based on Foata normal form. 84/3120 useless extension candidates. Maximal degree in co-relation 8223. Up to 2221 conditions per place. [2022-12-13 00:33:21,855 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 42 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2022-12-13 00:33:21,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 242 flow [2022-12-13 00:33:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:33:21,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2022-12-13 00:33:21,859 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 105 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:33:21,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 242 flow [2022-12-13 00:33:21,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:21,864 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 108 flow [2022-12-13 00:33:21,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 00:33:21,865 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2022-12-13 00:33:21,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:21,865 INFO L89 Accepts]: Start accepts. Operand has 46 places, 35 transitions, 108 flow [2022-12-13 00:33:21,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:21,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:21,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 108 flow [2022-12-13 00:33:21,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 108 flow [2022-12-13 00:33:21,874 INFO L130 PetriNetUnfolder]: 6/61 cut-off events. [2022-12-13 00:33:21,874 INFO L131 PetriNetUnfolder]: For 9/12 co-relation queries the response was YES. [2022-12-13 00:33:21,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 61 events. 6/61 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 225 event pairs, 2 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 94. Up to 16 conditions per place. [2022-12-13 00:33:21,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 108 flow [2022-12-13 00:33:21,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 00:33:21,881 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:21,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 00:33:21,889 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 108 flow [2022-12-13 00:33:21,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 00:33:21,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:21,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:21,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:33:21,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1330828933, now seen corresponding path program 1 times [2022-12-13 00:33:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:21,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466634203] [2022-12-13 00:33:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:22,007 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 00:33:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:22,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466634203] [2022-12-13 00:33:22,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466634203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:22,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:22,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:33:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307046814] [2022-12-13 00:33:22,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:22,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:33:22,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 00:33:22,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:22,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:33:22,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:22,298 INFO L130 PetriNetUnfolder]: 1971/3061 cut-off events. [2022-12-13 00:33:22,298 INFO L131 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2022-12-13 00:33:22,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7091 conditions, 3061 events. 1971/3061 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14661 event pairs, 559 based on Foata normal form. 32/2651 useless extension candidates. Maximal degree in co-relation 7077. Up to 2065 conditions per place. [2022-12-13 00:33:22,315 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 37 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-13 00:33:22,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 220 flow [2022-12-13 00:33:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 00:33:22,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-13 00:33:22,316 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 108 flow. Second operand 3 states and 59 transitions. [2022-12-13 00:33:22,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 220 flow [2022-12-13 00:33:22,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:22,319 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 113 flow [2022-12-13 00:33:22,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 00:33:22,320 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2022-12-13 00:33:22,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:22,320 INFO L89 Accepts]: Start accepts. Operand has 46 places, 35 transitions, 113 flow [2022-12-13 00:33:22,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:22,321 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:22,321 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 113 flow [2022-12-13 00:33:22,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 113 flow [2022-12-13 00:33:22,327 INFO L130 PetriNetUnfolder]: 5/59 cut-off events. [2022-12-13 00:33:22,327 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 00:33:22,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 59 events. 5/59 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 93. Up to 14 conditions per place. [2022-12-13 00:33:22,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 113 flow [2022-12-13 00:33:22,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 608 [2022-12-13 00:33:22,330 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:22,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 00:33:22,331 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 113 flow [2022-12-13 00:33:22,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 00:33:22,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:22,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:22,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:33:22,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 489556048, now seen corresponding path program 1 times [2022-12-13 00:33:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:22,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927151539] [2022-12-13 00:33:22,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:22,494 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 00:33:22,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:22,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927151539] [2022-12-13 00:33:22,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927151539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:22,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:22,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:33:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629127349] [2022-12-13 00:33:22,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:22,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:33:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:22,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:33:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:33:22,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:33:22,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 00:33:22,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:22,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:33:22,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:22,780 INFO L130 PetriNetUnfolder]: 1638/2604 cut-off events. [2022-12-13 00:33:22,781 INFO L131 PetriNetUnfolder]: For 1290/1308 co-relation queries the response was YES. [2022-12-13 00:33:22,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 2604 events. 1638/2604 cut-off events. For 1290/1308 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14587 event pairs, 493 based on Foata normal form. 36/1842 useless extension candidates. Maximal degree in co-relation 6014. Up to 2449 conditions per place. [2022-12-13 00:33:22,793 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 34 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-13 00:33:22,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 248 flow [2022-12-13 00:33:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 00:33:22,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 00:33:22,796 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 113 flow. Second operand 3 states and 68 transitions. [2022-12-13 00:33:22,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 248 flow [2022-12-13 00:33:22,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:22,800 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 175 flow [2022-12-13 00:33:22,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-13 00:33:22,802 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2022-12-13 00:33:22,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:22,803 INFO L89 Accepts]: Start accepts. Operand has 47 places, 44 transitions, 175 flow [2022-12-13 00:33:22,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:22,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:22,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 175 flow [2022-12-13 00:33:22,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 175 flow [2022-12-13 00:33:22,838 INFO L130 PetriNetUnfolder]: 275/575 cut-off events. [2022-12-13 00:33:22,838 INFO L131 PetriNetUnfolder]: For 204/237 co-relation queries the response was YES. [2022-12-13 00:33:22,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 575 events. 275/575 cut-off events. For 204/237 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 3624 event pairs, 127 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 1186. Up to 457 conditions per place. [2022-12-13 00:33:22,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 175 flow [2022-12-13 00:33:22,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 722 [2022-12-13 00:33:22,898 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:22,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 00:33:22,899 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 175 flow [2022-12-13 00:33:22,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 00:33:22,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:22,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:22,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:33:22,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1796453719, now seen corresponding path program 1 times [2022-12-13 00:33:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:22,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900364226] [2022-12-13 00:33:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:23,116 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 00:33:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900364226] [2022-12-13 00:33:23,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900364226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:23,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:23,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:33:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372053191] [2022-12-13 00:33:23,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:23,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:33:23,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:23,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:33:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:33:23,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:33:23,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 00:33:23,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:23,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:33:23,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:23,706 INFO L130 PetriNetUnfolder]: 3173/5077 cut-off events. [2022-12-13 00:33:23,706 INFO L131 PetriNetUnfolder]: For 2773/2892 co-relation queries the response was YES. [2022-12-13 00:33:23,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14163 conditions, 5077 events. 3173/5077 cut-off events. For 2773/2892 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 30519 event pairs, 436 based on Foata normal form. 152/4333 useless extension candidates. Maximal degree in co-relation 14147. Up to 2735 conditions per place. [2022-12-13 00:33:23,733 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 75 selfloop transitions, 9 changer transitions 4/98 dead transitions. [2022-12-13 00:33:23,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 541 flow [2022-12-13 00:33:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:33:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:33:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-13 00:33:23,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2022-12-13 00:33:23,734 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 175 flow. Second operand 6 states and 115 transitions. [2022-12-13 00:33:23,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 541 flow [2022-12-13 00:33:23,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:33:23,738 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 207 flow [2022-12-13 00:33:23,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-12-13 00:33:23,738 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2022-12-13 00:33:23,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:23,738 INFO L89 Accepts]: Start accepts. Operand has 53 places, 48 transitions, 207 flow [2022-12-13 00:33:23,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:23,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:23,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 48 transitions, 207 flow [2022-12-13 00:33:23,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 48 transitions, 207 flow [2022-12-13 00:33:23,810 INFO L130 PetriNetUnfolder]: 612/1170 cut-off events. [2022-12-13 00:33:23,811 INFO L131 PetriNetUnfolder]: For 386/417 co-relation queries the response was YES. [2022-12-13 00:33:23,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 1170 events. 612/1170 cut-off events. For 386/417 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 7856 event pairs, 272 based on Foata normal form. 3/567 useless extension candidates. Maximal degree in co-relation 2391. Up to 991 conditions per place. [2022-12-13 00:33:23,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 48 transitions, 207 flow [2022-12-13 00:33:23,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 770 [2022-12-13 00:33:23,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] $Ultimate##0-->L775: Formula: (and (= v_~y~0_31 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~y~0] and [500] L757-->L763: Formula: (and (= v_~x~0_56 v_~__unbuffered_p0_EAX~0_163) (= v_~__unbuffered_p0_EBX~0_176 v_~y~0_84)) InVars {~y~0=v_~y~0_84, ~x~0=v_~x~0_56} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_163, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_176, ~y~0=v_~y~0_84, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0] [2022-12-13 00:33:23,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] $Ultimate##0-->L775: Formula: (and (= v_~y~0_31 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~y~0] and [368] L815-->L831: Formula: (let ((.cse11 (= (mod v_~z$r_buff1_thd3~0_60 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~z$w_buff0_used~0_144 256) 0)) (.cse2 (and .cse11 .cse8)) (.cse3 (and (= (mod v_~z$w_buff1_used~0_129 256) 0) .cse8))) (let ((.cse5 (or .cse12 .cse2 .cse3)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse1 (ite .cse5 v_~z~0_105 (ite .cse6 v_~z$w_buff0~0_79 v_~z$w_buff1~0_84))) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_128 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_143 256) 0))) (and (= v_~z~0_104 (ite .cse0 v_~z$mem_tmp~0_36 .cse1)) (= v_~z$mem_tmp~0_36 v_~z~0_105) (= |v_P2Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_62) (= |v_P2Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_10) (= (ite .cse0 v_~z$w_buff1_used~0_129 (ite (or .cse2 .cse3 .cse4) v_~z$w_buff1_used~0_129 0)) v_~z$w_buff1_used~0_128) (= v_~z$flush_delayed~0_40 0) (= .cse1 v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff0_used~0_143 (ite .cse0 v_~z$w_buff0_used~0_144 (ite .cse5 v_~z$w_buff0_used~0_144 (ite .cse6 0 v_~z$w_buff0_used~0_144)))) (= v_~z$r_buff0_thd3~0_66 (ite .cse0 v_~z$r_buff0_thd3~0_67 (ite (or .cse2 .cse4 (and .cse7 .cse8)) v_~z$r_buff0_thd3~0_67 (ite (and .cse9 (not .cse4)) 0 v_~z$r_buff0_thd3~0_67)))) (= v_~z$r_buff1_thd3~0_59 (ite .cse0 v_~z$r_buff1_thd3~0_60 (ite (let ((.cse10 (= (mod v_~z$r_buff0_thd3~0_66 256) 0))) (or (and .cse7 .cse10) .cse4 (and .cse11 .cse10))) v_~z$r_buff1_thd3~0_60 0))) (= v_~z$w_buff0~0_79 v_~z$w_buff0~0_78) (= v_~z$w_buff1~0_84 v_~z$w_buff1~0_83)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_79, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_60, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_84, ~z~0=v_~z~0_105, P2Thread1of1ForFork1_#t~nondet6#1=|v_P2Thread1of1ForFork1_#t~nondet6#1_1|, P2Thread1of1ForFork1_#t~nondet5#1=|v_P2Thread1of1ForFork1_#t~nondet5#1_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_78, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_59, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_128, ~z$w_buff1~0=v_~z$w_buff1~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_62} 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, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet5#1, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet6#1] [2022-12-13 00:33:24,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] $Ultimate##0-->L763: Formula: (and (= v_~y~0_86 1) (= v_~__unbuffered_p0_EBX~0_178 v_~y~0_86) (= v_~x~0_58 v_~__unbuffered_p0_EAX~0_165) (= |v_P1Thread1of1ForFork0_#in~arg.offset_13| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_13|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_13|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_13|, ~x~0=v_~x~0_58} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_165, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_178, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_13|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_13|, ~y~0=v_~y~0_86, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~y~0] and [360] L775-->L778: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 00:33:24,185 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:33:24,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 448 [2022-12-13 00:33:24,186 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 210 flow [2022-12-13 00:33:24,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 00:33:24,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:24,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:24,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:33:24,187 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1400106515, now seen corresponding path program 2 times [2022-12-13 00:33:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:24,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290314673] [2022-12-13 00:33:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:24,372 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 00:33:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:24,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290314673] [2022-12-13 00:33:24,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290314673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:24,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:24,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:33:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075141111] [2022-12-13 00:33:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:24,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:24,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:33:24,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 00:33:24,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:24,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:33:24,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:24,680 INFO L130 PetriNetUnfolder]: 1466/2694 cut-off events. [2022-12-13 00:33:24,681 INFO L131 PetriNetUnfolder]: For 1724/1749 co-relation queries the response was YES. [2022-12-13 00:33:24,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7874 conditions, 2694 events. 1466/2694 cut-off events. For 1724/1749 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16992 event pairs, 196 based on Foata normal form. 177/1983 useless extension candidates. Maximal degree in co-relation 7855. Up to 1954 conditions per place. [2022-12-13 00:33:24,694 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 44 selfloop transitions, 19 changer transitions 1/74 dead transitions. [2022-12-13 00:33:24,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 428 flow [2022-12-13 00:33:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:33:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:33:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 00:33:24,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:33:24,695 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 210 flow. Second operand 4 states and 96 transitions. [2022-12-13 00:33:24,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 428 flow [2022-12-13 00:33:24,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 420 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 00:33:24,703 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 304 flow [2022-12-13 00:33:24,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2022-12-13 00:33:24,705 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2022-12-13 00:33:24,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:24,705 INFO L89 Accepts]: Start accepts. Operand has 55 places, 55 transitions, 304 flow [2022-12-13 00:33:24,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:24,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:24,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 304 flow [2022-12-13 00:33:24,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 304 flow [2022-12-13 00:33:24,762 INFO L130 PetriNetUnfolder]: 377/877 cut-off events. [2022-12-13 00:33:24,762 INFO L131 PetriNetUnfolder]: For 458/585 co-relation queries the response was YES. [2022-12-13 00:33:24,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 877 events. 377/877 cut-off events. For 458/585 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 6365 event pairs, 56 based on Foata normal form. 6/479 useless extension candidates. Maximal degree in co-relation 2714. Up to 703 conditions per place. [2022-12-13 00:33:24,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 304 flow [2022-12-13 00:33:24,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-13 00:33:24,798 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:24,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 00:33:24,800 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 304 flow [2022-12-13 00:33:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 00:33:24,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:24,800 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 00:33:24,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:33:24,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1455172455, now seen corresponding path program 1 times [2022-12-13 00:33:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:24,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453614100] [2022-12-13 00:33:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:25,026 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 00:33:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:25,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453614100] [2022-12-13 00:33:25,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453614100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:25,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:25,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:33:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408573306] [2022-12-13 00:33:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:25,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:25,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 00:33:25,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:25,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:25,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 00:33:25,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:25,554 INFO L130 PetriNetUnfolder]: 2389/4419 cut-off events. [2022-12-13 00:33:25,554 INFO L131 PetriNetUnfolder]: For 5005/5507 co-relation queries the response was YES. [2022-12-13 00:33:25,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15751 conditions, 4419 events. 2389/4419 cut-off events. For 5005/5507 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 31202 event pairs, 383 based on Foata normal form. 297/3934 useless extension candidates. Maximal degree in co-relation 15730. Up to 2582 conditions per place. [2022-12-13 00:33:25,574 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 82 selfloop transitions, 15 changer transitions 5/115 dead transitions. [2022-12-13 00:33:25,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 810 flow [2022-12-13 00:33:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:33:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:33:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 00:33:25,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6294117647058823 [2022-12-13 00:33:25,576 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 304 flow. Second operand 5 states and 107 transitions. [2022-12-13 00:33:25,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 810 flow [2022-12-13 00:33:25,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 115 transitions, 732 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:25,586 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 372 flow [2022-12-13 00:33:25,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2022-12-13 00:33:25,587 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -8 predicate places. [2022-12-13 00:33:25,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:25,587 INFO L89 Accepts]: Start accepts. Operand has 59 places, 64 transitions, 372 flow [2022-12-13 00:33:25,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:25,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:25,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 64 transitions, 372 flow [2022-12-13 00:33:25,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 64 transitions, 372 flow [2022-12-13 00:33:25,712 INFO L130 PetriNetUnfolder]: 805/2057 cut-off events. [2022-12-13 00:33:25,712 INFO L131 PetriNetUnfolder]: For 1238/1423 co-relation queries the response was YES. [2022-12-13 00:33:25,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 2057 events. 805/2057 cut-off events. For 1238/1423 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 18299 event pairs, 126 based on Foata normal form. 13/1150 useless extension candidates. Maximal degree in co-relation 5441. Up to 1486 conditions per place. [2022-12-13 00:33:25,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 64 transitions, 372 flow [2022-12-13 00:33:25,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-13 00:33:25,750 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:25,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 00:33:25,751 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 372 flow [2022-12-13 00:33:25,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:25,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:25,751 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 00:33:25,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:33:25,751 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1048243160, now seen corresponding path program 1 times [2022-12-13 00:33:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:25,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114722864] [2022-12-13 00:33:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:25,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:25,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:25,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114722864] [2022-12-13 00:33:25,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114722864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:25,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:25,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:33:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664339080] [2022-12-13 00:33:25,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:25,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:33:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:33:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:33:25,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:33:25,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 372 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 00:33:25,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:25,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:33:25,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:26,276 INFO L130 PetriNetUnfolder]: 1299/2477 cut-off events. [2022-12-13 00:33:26,276 INFO L131 PetriNetUnfolder]: For 2001/2239 co-relation queries the response was YES. [2022-12-13 00:33:26,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8288 conditions, 2477 events. 1299/2477 cut-off events. For 2001/2239 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16738 event pairs, 116 based on Foata normal form. 356/1778 useless extension candidates. Maximal degree in co-relation 8265. Up to 1216 conditions per place. [2022-12-13 00:33:26,286 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 33 selfloop transitions, 28 changer transitions 11/84 dead transitions. [2022-12-13 00:33:26,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 84 transitions, 588 flow [2022-12-13 00:33:26,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:33:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:33:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 00:33:26,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6058823529411764 [2022-12-13 00:33:26,287 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 372 flow. Second operand 5 states and 103 transitions. [2022-12-13 00:33:26,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 84 transitions, 588 flow [2022-12-13 00:33:26,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 563 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 00:33:26,294 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 375 flow [2022-12-13 00:33:26,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2022-12-13 00:33:26,295 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -6 predicate places. [2022-12-13 00:33:26,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:26,296 INFO L89 Accepts]: Start accepts. Operand has 61 places, 58 transitions, 375 flow [2022-12-13 00:33:26,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:26,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:26,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 375 flow [2022-12-13 00:33:26,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 58 transitions, 375 flow [2022-12-13 00:33:26,354 INFO L130 PetriNetUnfolder]: 253/693 cut-off events. [2022-12-13 00:33:26,355 INFO L131 PetriNetUnfolder]: For 358/606 co-relation queries the response was YES. [2022-12-13 00:33:26,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 693 events. 253/693 cut-off events. For 358/606 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 4949 event pairs, 2 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 2365. Up to 469 conditions per place. [2022-12-13 00:33:26,361 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 58 transitions, 375 flow [2022-12-13 00:33:26,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-13 00:33:26,932 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:33:26,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 638 [2022-12-13 00:33:26,933 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 372 flow [2022-12-13 00:33:26,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 00:33:26,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:26,934 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 00:33:26,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:33:26,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1233066466, now seen corresponding path program 1 times [2022-12-13 00:33:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:26,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611506637] [2022-12-13 00:33:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:27,134 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 00:33:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611506637] [2022-12-13 00:33:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611506637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:27,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:27,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:33:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627398592] [2022-12-13 00:33:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:27,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:27,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:27,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 00:33:27,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 00:33:27,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:27,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 00:33:27,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:27,332 INFO L130 PetriNetUnfolder]: 769/1468 cut-off events. [2022-12-13 00:33:27,333 INFO L131 PetriNetUnfolder]: For 3338/3500 co-relation queries the response was YES. [2022-12-13 00:33:27,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6136 conditions, 1468 events. 769/1468 cut-off events. For 3338/3500 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 8806 event pairs, 130 based on Foata normal form. 92/1200 useless extension candidates. Maximal degree in co-relation 6113. Up to 773 conditions per place. [2022-12-13 00:33:27,341 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 1 changer transitions 44/92 dead transitions. [2022-12-13 00:33:27,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 770 flow [2022-12-13 00:33:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:33:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:33:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 00:33:27,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6637931034482759 [2022-12-13 00:33:27,342 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 372 flow. Second operand 4 states and 77 transitions. [2022-12-13 00:33:27,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 770 flow [2022-12-13 00:33:27,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 634 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-12-13 00:33:27,365 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 232 flow [2022-12-13 00:33:27,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 00:33:27,366 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2022-12-13 00:33:27,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:27,366 INFO L89 Accepts]: Start accepts. Operand has 56 places, 45 transitions, 232 flow [2022-12-13 00:33:27,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:27,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:27,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 232 flow [2022-12-13 00:33:27,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 232 flow [2022-12-13 00:33:27,388 INFO L130 PetriNetUnfolder]: 112/272 cut-off events. [2022-12-13 00:33:27,388 INFO L131 PetriNetUnfolder]: For 349/381 co-relation queries the response was YES. [2022-12-13 00:33:27,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 272 events. 112/272 cut-off events. For 349/381 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1557 event pairs, 4 based on Foata normal form. 7/123 useless extension candidates. Maximal degree in co-relation 798. Up to 136 conditions per place. [2022-12-13 00:33:27,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 232 flow [2022-12-13 00:33:27,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 00:33:28,137 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:33:28,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 771 [2022-12-13 00:33:28,138 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 222 flow [2022-12-13 00:33:28,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 00:33:28,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:28,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:28,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:33:28,138 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1859557952, now seen corresponding path program 1 times [2022-12-13 00:33:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:28,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600001817] [2022-12-13 00:33:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:28,964 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 00:33:28,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:28,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600001817] [2022-12-13 00:33:28,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600001817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:28,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:28,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:33:28,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671661747] [2022-12-13 00:33:28,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:28,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:33:28,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:28,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:33:28,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:33:28,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 00:33:28,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:28,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:28,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 00:33:28,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:29,113 INFO L130 PetriNetUnfolder]: 258/511 cut-off events. [2022-12-13 00:33:29,113 INFO L131 PetriNetUnfolder]: For 1127/1151 co-relation queries the response was YES. [2022-12-13 00:33:29,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 511 events. 258/511 cut-off events. For 1127/1151 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 2808 event pairs, 4 based on Foata normal form. 47/411 useless extension candidates. Maximal degree in co-relation 1780. Up to 214 conditions per place. [2022-12-13 00:33:29,115 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 34 selfloop transitions, 4 changer transitions 22/70 dead transitions. [2022-12-13 00:33:29,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 510 flow [2022-12-13 00:33:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:33:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:33:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-13 00:33:29,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2022-12-13 00:33:29,117 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 222 flow. Second operand 6 states and 62 transitions. [2022-12-13 00:33:29,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 510 flow [2022-12-13 00:33:29,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 486 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 00:33:29,120 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 216 flow [2022-12-13 00:33:29,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-13 00:33:29,121 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2022-12-13 00:33:29,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:29,121 INFO L89 Accepts]: Start accepts. Operand has 50 places, 40 transitions, 216 flow [2022-12-13 00:33:29,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:29,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:29,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 216 flow [2022-12-13 00:33:29,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 216 flow [2022-12-13 00:33:29,140 INFO L130 PetriNetUnfolder]: 99/232 cut-off events. [2022-12-13 00:33:29,140 INFO L131 PetriNetUnfolder]: For 312/315 co-relation queries the response was YES. [2022-12-13 00:33:29,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 232 events. 99/232 cut-off events. For 312/315 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1255 event pairs, 0 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 710. Up to 118 conditions per place. [2022-12-13 00:33:29,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 216 flow [2022-12-13 00:33:29,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 00:33:30,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] L834-->L844: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_432 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_237 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_196 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_385 256) 0)))) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_433 256) 0)) .cse5)) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~z$w_buff0~0_298 (ite .cse1 v_~z$w_buff1~0_280 v_~z~0_346)) v_~z~0_345) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd3~0_236 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_384 256) 0)))) 0 v_~z$r_buff1_thd3~0_196) v_~z$r_buff1_thd3~0_195) (= v_~z$w_buff1_used~0_384 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_385)) (= v_~__unbuffered_cnt~0_581 (+ v_~__unbuffered_cnt~0_582 1)) (= v_~z$w_buff0_used~0_432 (ite .cse0 0 v_~z$w_buff0_used~0_433)) (= v_~z$r_buff0_thd3~0_236 (ite .cse4 0 v_~z$r_buff0_thd3~0_237))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_433, ~z$w_buff0~0=v_~z$w_buff0~0_298, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_385, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_237, ~z$w_buff1~0=v_~z$w_buff1~0_280, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_582, ~z~0=v_~z~0_346} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_432, ~z$w_buff0~0=v_~z$w_buff0~0_298, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_384, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_236, ~z$w_buff1~0=v_~z$w_buff1~0_280, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_581, ~z~0=v_~z~0_345} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0] and [508] L863-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_410 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_133 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_131 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_367 256) 0)) .cse0)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_411 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_366 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) 0 v_~z$r_buff1_thd0~0_131) v_~z$r_buff1_thd0~0_130) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_133| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_133|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_166 0) (= v_~__unbuffered_p0_EBX~0_184 0) (= v_~__unbuffered_p1_EAX~0_164 1) (= v_~__unbuffered_p2_EAX~0_172 1) (= v_~__unbuffered_p0_EAX~0_171 1) (= v_~__unbuffered_p1_EBX~0_195 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_172) (= (ite .cse2 v_~z$w_buff0~0_282 (ite .cse3 v_~z$w_buff1~0_268 v_~z~0_326)) v_~z~0_325) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_367) v_~z$w_buff1_used~0_366) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127| (mod v_~main$tmp_guard1~0_172 256)) (= v_~main$tmp_guard0~0_110 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= (ite .cse2 0 v_~z$w_buff0_used~0_411) v_~z$w_buff0_used~0_410) (= v_~z$r_buff0_thd0~0_132 (ite .cse4 0 v_~z$r_buff0_thd0~0_133)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0))))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_184, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_166, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_411, ~z$w_buff0~0=v_~z$w_buff0~0_282, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_367, ~z$w_buff1~0=v_~z$w_buff1~0_268, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_171, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_133, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_164, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_172, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~z~0=v_~z~0_326} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_133|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_184, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_166, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_89|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_410, ~z$w_buff0~0=v_~z$w_buff0~0_282, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_366, ~z$w_buff1~0=v_~z$w_buff1~0_268, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_172, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_171, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_164, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_172, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~z~0=v_~z~0_325, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:33:31,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L834-->P2FINAL: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_204 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_440 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_245 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_441 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_393 256) 0))))) (and (= |v_P2Thread1of1ForFork1_#res#1.offset_79| 0) (= v_~__unbuffered_cnt~0_589 (+ v_~__unbuffered_cnt~0_590 1)) (= v_~z~0_353 (ite .cse0 v_~z$w_buff0~0_302 (ite .cse1 v_~z$w_buff1~0_284 v_~z~0_354))) (= v_~z$r_buff0_thd3~0_244 (ite .cse2 0 v_~z$r_buff0_thd3~0_245)) (= |v_P2Thread1of1ForFork1_#res#1.base_79| 0) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_392 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_244 256) 0)))) 0 v_~z$r_buff1_thd3~0_204) v_~z$r_buff1_thd3~0_203) (= v_~z$w_buff0_used~0_440 (ite .cse0 0 v_~z$w_buff0_used~0_441)) (= v_~z$w_buff1_used~0_392 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_393))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_441, ~z$w_buff0~0=v_~z$w_buff0~0_302, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_204, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_393, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_245, ~z$w_buff1~0=v_~z$w_buff1~0_284, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_590, ~z~0=v_~z~0_354} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_79|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_440, ~z$w_buff0~0=v_~z$w_buff0~0_302, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_203, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_392, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_244, ~z$w_buff1~0=v_~z$w_buff1~0_284, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_589, ~z~0=v_~z~0_353, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_79|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, P2Thread1of1ForFork1_#res#1.base] and [508] L863-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_410 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_133 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_131 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_367 256) 0)) .cse0)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_411 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_366 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) 0 v_~z$r_buff1_thd0~0_131) v_~z$r_buff1_thd0~0_130) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_133| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_133|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_166 0) (= v_~__unbuffered_p0_EBX~0_184 0) (= v_~__unbuffered_p1_EAX~0_164 1) (= v_~__unbuffered_p2_EAX~0_172 1) (= v_~__unbuffered_p0_EAX~0_171 1) (= v_~__unbuffered_p1_EBX~0_195 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_172) (= (ite .cse2 v_~z$w_buff0~0_282 (ite .cse3 v_~z$w_buff1~0_268 v_~z~0_326)) v_~z~0_325) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_367) v_~z$w_buff1_used~0_366) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127| (mod v_~main$tmp_guard1~0_172 256)) (= v_~main$tmp_guard0~0_110 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= (ite .cse2 0 v_~z$w_buff0_used~0_411) v_~z$w_buff0_used~0_410) (= v_~z$r_buff0_thd0~0_132 (ite .cse4 0 v_~z$r_buff0_thd0~0_133)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0))))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_184, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_166, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_411, ~z$w_buff0~0=v_~z$w_buff0~0_282, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_367, ~z$w_buff1~0=v_~z$w_buff1~0_268, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_171, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_133, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_164, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_172, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~z~0=v_~z~0_326} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_133|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_184, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_166, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_89|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_410, ~z$w_buff0~0=v_~z$w_buff0~0_282, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_366, ~z$w_buff1~0=v_~z$w_buff1~0_268, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_172, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_171, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_164, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_172, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~z~0=v_~z~0_325, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:33:31,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [519] L834-->P2EXIT: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_448 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_253 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_212 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_401 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_449 256) 0)) .cse5))) (and (= v_~z~0_361 (ite .cse0 v_~z$w_buff0~0_306 (ite .cse1 v_~z$w_buff1~0_288 v_~z~0_362))) (= |v_P2Thread1of1ForFork1_#res#1.base_83| 0) (= v_~__unbuffered_cnt~0_597 (+ v_~__unbuffered_cnt~0_598 1)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd3~0_252 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_400 256) 0)))) 0 v_~z$r_buff1_thd3~0_212) v_~z$r_buff1_thd3~0_211) (= v_~z$r_buff0_thd3~0_252 (ite .cse4 0 v_~z$r_buff0_thd3~0_253)) (= v_~z$w_buff1_used~0_400 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_401)) (= (ite .cse0 0 v_~z$w_buff0_used~0_449) v_~z$w_buff0_used~0_448) (= |v_P2Thread1of1ForFork1_#res#1.offset_83| 0)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_449, ~z$w_buff0~0=v_~z$w_buff0~0_306, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_401, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_253, ~z$w_buff1~0=v_~z$w_buff1~0_288, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_598, ~z~0=v_~z~0_362} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_83|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_448, ~z$w_buff0~0=v_~z$w_buff0~0_306, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_211, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_400, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_252, ~z$w_buff1~0=v_~z$w_buff1~0_288, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_597, ~z~0=v_~z~0_361, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_83|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, P2Thread1of1ForFork1_#res#1.base] and [508] L863-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_410 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_133 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_131 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_367 256) 0)) .cse0)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_411 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_366 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd0~0_132 256) 0)))) 0 v_~z$r_buff1_thd0~0_131) v_~z$r_buff1_thd0~0_130) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_133| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_133|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_166 0) (= v_~__unbuffered_p0_EBX~0_184 0) (= v_~__unbuffered_p1_EAX~0_164 1) (= v_~__unbuffered_p2_EAX~0_172 1) (= v_~__unbuffered_p0_EAX~0_171 1) (= v_~__unbuffered_p1_EBX~0_195 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_172) (= (ite .cse2 v_~z$w_buff0~0_282 (ite .cse3 v_~z$w_buff1~0_268 v_~z~0_326)) v_~z~0_325) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_367) v_~z$w_buff1_used~0_366) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63| (mod v_~main$tmp_guard0~0_110 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127| (mod v_~main$tmp_guard1~0_172 256)) (= v_~main$tmp_guard0~0_110 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= (ite .cse2 0 v_~z$w_buff0_used~0_411) v_~z$w_buff0_used~0_410) (= v_~z$r_buff0_thd0~0_132 (ite .cse4 0 v_~z$r_buff0_thd0~0_133)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0))))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_184, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_166, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_411, ~z$w_buff0~0=v_~z$w_buff0~0_282, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_367, ~z$w_buff1~0=v_~z$w_buff1~0_268, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_171, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_133, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_164, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_131, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_172, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~z~0=v_~z~0_326} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_133|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_184, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_195, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_166, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_89|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_410, ~z$w_buff0~0=v_~z$w_buff0~0_282, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_366, ~z$w_buff1~0=v_~z$w_buff1~0_268, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_172, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_171, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_132, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_127|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_164, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_172, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~z~0=v_~z~0_325, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:33:32,009 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:33:32,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2889 [2022-12-13 00:33:32,010 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 284 flow [2022-12-13 00:33:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:32,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:32,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:32,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:33:32,010 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash -666154382, now seen corresponding path program 1 times [2022-12-13 00:33:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:32,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742208180] [2022-12-13 00:33:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:33:32,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:33:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:33:32,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:33:32,141 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:33:32,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:33:32,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:33:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:33:32,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:33:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:33:32,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:33:32,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:33:32,147 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:32,152 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:33:32,152 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:33:32,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:33:32 BasicIcfg [2022-12-13 00:33:32,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:33:32,232 INFO L158 Benchmark]: Toolchain (without parser) took 21529.62ms. Allocated memory was 179.3MB in the beginning and 733.0MB in the end (delta: 553.6MB). Free memory was 153.2MB in the beginning and 275.2MB in the end (delta: -122.0MB). Peak memory consumption was 432.7MB. Max. memory is 8.0GB. [2022-12-13 00:33:32,232 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:33:32,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.93ms. Allocated memory is still 179.3MB. Free memory was 153.1MB in the beginning and 125.0MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 00:33:32,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.08ms. Allocated memory is still 179.3MB. Free memory was 125.0MB in the beginning and 122.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:33:32,232 INFO L158 Benchmark]: Boogie Preprocessor took 34.38ms. Allocated memory is still 179.3MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:33:32,233 INFO L158 Benchmark]: RCFGBuilder took 764.98ms. Allocated memory is still 179.3MB. Free memory was 120.4MB in the beginning and 119.8MB in the end (delta: 555.7kB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2022-12-13 00:33:32,233 INFO L158 Benchmark]: TraceAbstraction took 20099.56ms. Allocated memory was 179.3MB in the beginning and 733.0MB in the end (delta: 553.6MB). Free memory was 118.7MB in the beginning and 275.2MB in the end (delta: -156.4MB). Peak memory consumption was 397.2MB. Max. memory is 8.0GB. [2022-12-13 00:33:32,234 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.93ms. Allocated memory is still 179.3MB. Free memory was 153.1MB in the beginning and 125.0MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.08ms. Allocated memory is still 179.3MB. Free memory was 125.0MB in the beginning and 122.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.38ms. Allocated memory is still 179.3MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 764.98ms. Allocated memory is still 179.3MB. Free memory was 120.4MB in the beginning and 119.8MB in the end (delta: 555.7kB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. * TraceAbstraction took 20099.56ms. Allocated memory was 179.3MB in the beginning and 733.0MB in the end (delta: 553.6MB). Free memory was 118.7MB in the beginning and 275.2MB in the end (delta: -156.4MB). Peak memory consumption was 397.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 120 PlacesBefore, 67 PlacesAfterwards, 112 TransitionsBefore, 57 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 3734, independent unconditional: 0, dependent: 171, dependent conditional: 171, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 0, independent unconditional: 3734, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 0, independent unconditional: 3734, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3905, independent: 3734, independent conditional: 0, independent unconditional: 3734, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2052, independent: 1978, independent conditional: 0, independent unconditional: 1978, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2052, independent: 1947, independent conditional: 0, independent unconditional: 1947, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 251, dependent conditional: 0, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3905, independent: 1756, independent conditional: 0, independent unconditional: 1756, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 2052, unknown conditional: 0, unknown unconditional: 2052] , Statistics on independence cache: Total cache size (in pairs): 3488, Positive cache size: 3414, Positive conditional cache size: 0, Positive unconditional cache size: 3414, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 474, independent: 436, independent conditional: 436, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 474, independent: 436, independent conditional: 18, independent unconditional: 418, dependent: 38, dependent conditional: 8, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 474, independent: 436, independent conditional: 18, independent unconditional: 418, dependent: 38, dependent conditional: 8, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 474, independent: 436, independent conditional: 18, independent unconditional: 418, dependent: 38, dependent conditional: 8, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 341, independent: 314, independent conditional: 16, independent unconditional: 298, dependent: 27, dependent conditional: 4, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 341, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 27, dependent conditional: 4, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 101, dependent conditional: 24, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 474, independent: 122, independent conditional: 2, independent unconditional: 120, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 341, unknown conditional: 20, unknown unconditional: 321] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 314, Positive conditional cache size: 16, Positive unconditional cache size: 298, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 335, independent: 304, independent conditional: 304, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 335, independent: 304, independent conditional: 16, independent unconditional: 288, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 335, independent: 304, independent conditional: 0, independent unconditional: 304, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 335, independent: 304, independent conditional: 0, independent unconditional: 304, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, independent: 265, independent conditional: 0, independent unconditional: 265, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 353, Positive conditional cache size: 16, Positive unconditional cache size: 337, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, independent: 268, independent conditional: 268, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 299, independent: 268, independent conditional: 18, independent unconditional: 250, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 299, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 299, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 353, Positive conditional cache size: 16, Positive unconditional cache size: 337, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 300, independent: 268, independent conditional: 268, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 300, independent: 268, independent conditional: 16, independent unconditional: 252, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 300, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 300, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 300, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 353, Positive conditional cache size: 16, Positive unconditional cache size: 337, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 298, independent: 266, independent conditional: 266, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 298, independent: 266, independent conditional: 16, independent unconditional: 250, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 298, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 298, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 298, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 353, Positive conditional cache size: 16, Positive unconditional cache size: 337, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 264, independent: 234, independent conditional: 234, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 264, independent: 234, independent conditional: 40, independent unconditional: 194, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 264, independent: 234, independent conditional: 30, independent unconditional: 204, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 264, independent: 234, independent conditional: 30, independent unconditional: 204, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 264, independent: 232, independent conditional: 30, independent unconditional: 202, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 355, Positive conditional cache size: 16, Positive unconditional cache size: 339, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 53 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 770 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 774, independent: 708, independent conditional: 708, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 774, independent: 708, independent conditional: 298, independent unconditional: 410, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 774, independent: 708, independent conditional: 250, independent unconditional: 458, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 774, independent: 708, independent conditional: 250, independent unconditional: 458, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 13, independent unconditional: 6, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 774, independent: 689, independent conditional: 237, independent unconditional: 452, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 19, unknown conditional: 13, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 505, Positive cache size: 465, Positive conditional cache size: 33, Positive unconditional cache size: 432, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 233, independent conditional: 233, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 233, independent conditional: 54, independent unconditional: 179, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 233, independent conditional: 42, independent unconditional: 191, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 233, independent conditional: 42, independent unconditional: 191, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 227, independent conditional: 42, independent unconditional: 185, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 471, Positive conditional cache size: 33, Positive unconditional cache size: 438, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 115, independent: 98, independent conditional: 31, independent unconditional: 67, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 471, Positive conditional cache size: 33, Positive unconditional cache size: 438, Negative cache size: 41, Negative conditional cache size: 4, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 59 PlacesBefore, 56 PlacesAfterwards, 58 TransitionsBefore, 55 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 238, independent: 210, independent conditional: 112, independent unconditional: 98, dependent: 28, dependent conditional: 9, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, independent: 210, independent conditional: 71, independent unconditional: 139, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, independent: 210, independent conditional: 71, independent unconditional: 139, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 238, independent: 203, independent conditional: 65, independent unconditional: 138, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 542, Positive conditional cache size: 41, Positive unconditional cache size: 501, Negative cache size: 41, Negative conditional cache size: 4, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 53 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 41 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, independent: 219, independent conditional: 219, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 245, independent: 219, independent conditional: 123, independent unconditional: 96, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 245, independent: 219, independent conditional: 123, independent unconditional: 96, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 245, independent: 219, independent conditional: 123, independent unconditional: 96, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 245, independent: 211, independent conditional: 119, independent unconditional: 92, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 629, Positive conditional cache size: 47, Positive unconditional cache size: 582, Negative cache size: 41, Negative conditional cache size: 4, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 48 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 163, independent conditional: 163, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 163, independent: 163, independent conditional: 159, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 163, independent conditional: 159, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 163, independent conditional: 159, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 154, independent conditional: 150, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 963, Positive cache size: 922, Positive conditional cache size: 56, Positive unconditional cache size: 866, Negative cache size: 41, Negative conditional cache size: 4, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-1, t41={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=0, t41={5:0}, t42={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=1, t41={5:0}, t42={6:0}, t43={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 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) [L822] 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)) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 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)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L753] 1 a = 1 [L756] 1 x = 1 [L759] 1 __unbuffered_p0_EAX = x [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 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 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 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 [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 29 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=10, InterpolantAutomatonStates: 48, 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.5s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:33:32,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...