/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/mix023_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:56:35,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:56:35,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:56:35,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:56:35,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:56:35,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:56:35,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:56:35,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:56:35,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:56:35,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:56:35,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:56:35,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:56:35,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:56:35,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:56:35,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:56:35,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:56:35,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:56:35,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:56:35,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:56:35,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:56:35,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:56:35,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:56:35,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:56:35,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:56:35,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:56:35,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:56:35,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:56:35,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:56:35,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:56:35,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:56:35,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:56:35,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:56:35,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:56:35,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:56:35,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:56:35,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:56:35,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:56:35,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:56:35,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:56:35,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:56:35,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:56:35,980 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-05 22:56:36,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:56:36,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:56:36,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:56:36,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:56:36,009 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:56:36,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:56:36,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:56:36,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:56:36,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:56:36,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:56:36,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:56:36,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:56:36,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:56:36,010 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:56:36,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:56:36,010 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:56:36,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:56:36,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:56:36,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:56:36,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:56:36,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:56:36,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:56:36,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:56:36,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:56:36,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:56:36,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:56:36,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:56:36,013 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:56:36,014 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-05 22:56:36,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:56:36,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:56:36,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:56:36,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:56:36,376 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:56:36,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:56:37,367 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:56:37,619 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:56:37,619 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:56:37,633 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f583607/ec19ed5a218642c19d569fefcda18c4d/FLAG592825c84 [2022-12-05 22:56:37,644 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f583607/ec19ed5a218642c19d569fefcda18c4d [2022-12-05 22:56:37,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:56:37,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:56:37,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:56:37,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:56:37,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:56:37,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:56:37" (1/1) ... [2022-12-05 22:56:37,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746ed3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:37, skipping insertion in model container [2022-12-05 22:56:37,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:56:37" (1/1) ... [2022-12-05 22:56:37,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:56:37,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:56:37,822 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 22:56:37,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:37,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:37,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:37,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:37,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:56:38,071 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:56:38,083 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 22:56:38,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:56:38,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:56:38,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:56:38,206 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:56:38,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38 WrapperNode [2022-12-05 22:56:38,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:56:38,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:56:38,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:56:38,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:56:38,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,268 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-05 22:56:38,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:56:38,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:56:38,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:56:38,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:56:38,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,307 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:56:38,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:56:38,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:56:38,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:56:38,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (1/1) ... [2022-12-05 22:56:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:56:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:56:38,353 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-05 22:56:38,377 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-05 22:56:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:56:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:56:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:56:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:56:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:56:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:56:38,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:56:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:56:38,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:56:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:56:38,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:56:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 22:56:38,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 22:56:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:56:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:56:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:56:38,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:56:38,397 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:56:38,516 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:56:38,518 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:56:38,791 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:56:38,959 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:56:38,959 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:56:38,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:56:38 BoogieIcfgContainer [2022-12-05 22:56:38,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:56:38,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:56:38,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:56:38,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:56:38,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:56:37" (1/3) ... [2022-12-05 22:56:38,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b933c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:56:38, skipping insertion in model container [2022-12-05 22:56:38,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:56:38" (2/3) ... [2022-12-05 22:56:38,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b933c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:56:38, skipping insertion in model container [2022-12-05 22:56:38,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:56:38" (3/3) ... [2022-12-05 22:56:38,973 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:56:38,990 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:56:38,990 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:56:38,990 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:56:39,058 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:56:39,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 22:56:39,204 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 22:56:39,205 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:39,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 22:56:39,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 22:56:39,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-05 22:56:39,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:39,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 22:56:39,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-05 22:56:39,258 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 22:56:39,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:39,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 22:56:39,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 22:56:39,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 3300 [2022-12-05 22:56:44,450 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-05 22:56:44,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:56:44,481 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;@6135fbbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:56:44,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 22:56:44,489 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-05 22:56:44,489 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:44,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:44,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 22:56:44,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 554300, now seen corresponding path program 1 times [2022-12-05 22:56:44,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:44,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370799292] [2022-12-05 22:56:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:44,837 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-05 22:56:44,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:44,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370799292] [2022-12-05 22:56:44,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370799292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:44,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:44,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:56:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052545573] [2022-12-05 22:56:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:44,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:44,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:44,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 22:56:44,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 22:56:44,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:44,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 22:56:44,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:45,989 INFO L130 PetriNetUnfolder]: 6050/8310 cut-off events. [2022-12-05 22:56:45,990 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-05 22:56:46,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16709 conditions, 8310 events. 6050/8310 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 42617 event pairs, 3098 based on Foata normal form. 0/7551 useless extension candidates. Maximal degree in co-relation 16697. Up to 6574 conditions per place. [2022-12-05 22:56:46,040 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-05 22:56:46,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-05 22:56:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-05 22:56:46,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-05 22:56:46,051 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 73 transitions. [2022-12-05 22:56:46,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 243 flow [2022-12-05 22:56:46,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 22:56:46,059 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 70 flow [2022-12-05 22:56:46,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-05 22:56:46,065 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-05 22:56:46,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:46,066 INFO L89 Accepts]: Start accepts. Operand has 45 places, 29 transitions, 70 flow [2022-12-05 22:56:46,068 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:46,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:46,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 70 flow [2022-12-05 22:56:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2022-12-05 22:56:46,083 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-05 22:56:46,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:56:46,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:56:46,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2022-12-05 22:56:46,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-05 22:56:46,194 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:46,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-05 22:56:46,196 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-05 22:56:46,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 22:56:46,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:46,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:46,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:56:46,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:46,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash 831268696, now seen corresponding path program 1 times [2022-12-05 22:56:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:46,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021744900] [2022-12-05 22:56:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:46,417 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-05 22:56:46,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:46,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021744900] [2022-12-05 22:56:46,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021744900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:46,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:46,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:56:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675861986] [2022-12-05 22:56:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:46,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:46,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:56:46,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:46,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:46,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:56:46,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:49,172 INFO L130 PetriNetUnfolder]: 20021/27147 cut-off events. [2022-12-05 22:56:49,173 INFO L131 PetriNetUnfolder]: For 1238/1238 co-relation queries the response was YES. [2022-12-05 22:56:49,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56149 conditions, 27147 events. 20021/27147 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 145613 event pairs, 6977 based on Foata normal form. 760/27907 useless extension candidates. Maximal degree in co-relation 56139. Up to 16658 conditions per place. [2022-12-05 22:56:49,315 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2022-12-05 22:56:49,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-12-05 22:56:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-05 22:56:49,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-05 22:56:49,317 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 54 transitions. [2022-12-05 22:56:49,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-12-05 22:56:49,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:56:49,319 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 136 flow [2022-12-05 22:56:49,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-05 22:56:49,320 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-05 22:56:49,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:49,320 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 136 flow [2022-12-05 22:56:49,321 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:49,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:49,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 136 flow [2022-12-05 22:56:49,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 136 flow [2022-12-05 22:56:49,383 INFO L130 PetriNetUnfolder]: 347/846 cut-off events. [2022-12-05 22:56:49,383 INFO L131 PetriNetUnfolder]: For 114/127 co-relation queries the response was YES. [2022-12-05 22:56:49,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 846 events. 347/846 cut-off events. For 114/127 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5837 event pairs, 149 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1670. Up to 377 conditions per place. [2022-12-05 22:56:49,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 136 flow [2022-12-05 22:56:49,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-05 22:56:49,423 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:49,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-05 22:56:49,425 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 136 flow [2022-12-05 22:56:49,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:49,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:49,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:49,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:56:49,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash -473243, now seen corresponding path program 1 times [2022-12-05 22:56:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:49,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113008580] [2022-12-05 22:56:49,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:49,615 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-05 22:56:49,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:49,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113008580] [2022-12-05 22:56:49,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113008580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:49,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498644855] [2022-12-05 22:56:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:49,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:49,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:56:49,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 136 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 22:56:49,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:49,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:56:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:51,970 INFO L130 PetriNetUnfolder]: 18540/25160 cut-off events. [2022-12-05 22:56:51,970 INFO L131 PetriNetUnfolder]: For 11590/11590 co-relation queries the response was YES. [2022-12-05 22:56:52,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63998 conditions, 25160 events. 18540/25160 cut-off events. For 11590/11590 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 130361 event pairs, 4807 based on Foata normal form. 275/25435 useless extension candidates. Maximal degree in co-relation 63986. Up to 10821 conditions per place. [2022-12-05 22:56:52,088 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 60 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2022-12-05 22:56:52,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 368 flow [2022-12-05 22:56:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 22:56:52,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2022-12-05 22:56:52,091 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 136 flow. Second operand 4 states and 63 transitions. [2022-12-05 22:56:52,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 368 flow [2022-12-05 22:56:52,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:56:52,158 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2022-12-05 22:56:52,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-05 22:56:52,159 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-05 22:56:52,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:52,160 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 186 flow [2022-12-05 22:56:52,161 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:52,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:52,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-05 22:56:52,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 186 flow [2022-12-05 22:56:52,211 INFO L130 PetriNetUnfolder]: 242/610 cut-off events. [2022-12-05 22:56:52,211 INFO L131 PetriNetUnfolder]: For 337/351 co-relation queries the response was YES. [2022-12-05 22:56:52,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 610 events. 242/610 cut-off events. For 337/351 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3789 event pairs, 82 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 1403. Up to 265 conditions per place. [2022-12-05 22:56:52,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-05 22:56:52,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-05 22:56:52,240 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:52,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-05 22:56:52,241 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2022-12-05 22:56:52,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 22:56:52,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:52,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:52,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:56:52,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash -23155516, now seen corresponding path program 1 times [2022-12-05 22:56:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209118714] [2022-12-05 22:56:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:52,395 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-05 22:56:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:52,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209118714] [2022-12-05 22:56:52,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209118714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:52,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:52,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168314887] [2022-12-05 22:56:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:52,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:52,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:56:52,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:52,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:52,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:56:52,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:54,230 INFO L130 PetriNetUnfolder]: 17488/23740 cut-off events. [2022-12-05 22:56:54,230 INFO L131 PetriNetUnfolder]: For 18061/18061 co-relation queries the response was YES. [2022-12-05 22:56:54,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63553 conditions, 23740 events. 17488/23740 cut-off events. For 18061/18061 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 126023 event pairs, 3445 based on Foata normal form. 200/23940 useless extension candidates. Maximal degree in co-relation 63538. Up to 10661 conditions per place. [2022-12-05 22:56:54,342 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 71 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2022-12-05 22:56:54,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 494 flow [2022-12-05 22:56:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-05 22:56:54,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2022-12-05 22:56:54,344 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 4 states and 71 transitions. [2022-12-05 22:56:54,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 494 flow [2022-12-05 22:56:54,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:54,377 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 298 flow [2022-12-05 22:56:54,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-05 22:56:54,379 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-05 22:56:54,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:54,379 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 298 flow [2022-12-05 22:56:54,380 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:54,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:54,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 298 flow [2022-12-05 22:56:54,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 298 flow [2022-12-05 22:56:54,419 INFO L130 PetriNetUnfolder]: 188/500 cut-off events. [2022-12-05 22:56:54,419 INFO L131 PetriNetUnfolder]: For 767/794 co-relation queries the response was YES. [2022-12-05 22:56:54,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 500 events. 188/500 cut-off events. For 767/794 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2979 event pairs, 60 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 1426. Up to 207 conditions per place. [2022-12-05 22:56:54,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 298 flow [2022-12-05 22:56:54,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-05 22:56:54,429 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:54,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-05 22:56:54,434 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 298 flow [2022-12-05 22:56:54,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:54,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:54,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:54,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:56:54,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1294698242, now seen corresponding path program 1 times [2022-12-05 22:56:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48381672] [2022-12-05 22:56:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:54,574 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-05 22:56:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:54,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48381672] [2022-12-05 22:56:54,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48381672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:54,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:54,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057685168] [2022-12-05 22:56:54,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:54,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:54,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:56:54,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-05 22:56:54,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:54,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:56:54,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:55,393 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L766-->L773: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_91 256) 0)) .cse0))) (and (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_90 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite .cse2 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= v_~a$r_buff0_thd1~0_26 (ite .cse3 0 v_~a$r_buff0_thd1~0_27)) (= (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_35 v_~a~0_55)) v_~a~0_54) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_91) v_~a$w_buff1_used~0_90)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_91} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_90} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 108#L773true, Black: 166#true, P1Thread1of1ForFork2InUse, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 5#L789true, 123#L887true, 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 103#L826true, Black: 154#true]) [2022-12-05 22:56:55,393 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 22:56:55,393 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 22:56:55,393 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 22:56:55,394 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 22:56:55,514 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L829-->L845: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_50 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse4 .cse8)) (.cse12 (= 0 (mod v_~a$w_buff0_used~0_144 256))) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_125 256) 0)))) (let ((.cse10 (or .cse2 .cse12 .cse9)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (ite .cse10 v_~a~0_85 (ite .cse11 v_~a$w_buff0~0_61 v_~a$w_buff1~0_58))) (.cse3 (= (mod v_~a$w_buff0_used~0_143 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse1 v_~a$r_buff0_thd4~0_58 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse3) .cse6) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~a$r_buff1_thd4~0_50 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse7 .cse8) .cse3 (and .cse7 .cse5))) v_~a$r_buff1_thd4~0_50 0)) v_~a$r_buff1_thd4~0_49) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= v_~a~0_84 (ite .cse1 v_~a$mem_tmp~0_14 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_125 (ite (or .cse2 .cse3 .cse9) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse1 v_~a$w_buff0_used~0_144 (ite .cse10 v_~a$w_buff0_used~0_144 (ite .cse11 0 v_~a$w_buff0_used~0_144))) v_~a$w_buff0_used~0_143)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_144, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_49, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_143, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][71], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 86#L845true, 166#true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 62#P2EXITtrue, 53#L766true, P3Thread1of1ForFork1InUse, 159#true, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 5#L789true, P2Thread1of1ForFork3InUse, 123#L887true, Black: 156#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-05 22:56:55,515 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,515 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,515 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,515 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,515 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L766-->L773: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_91 256) 0)) .cse0))) (and (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_90 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite .cse2 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= v_~a$r_buff0_thd1~0_26 (ite .cse3 0 v_~a$r_buff0_thd1~0_27)) (= (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_35 v_~a~0_55)) v_~a~0_54) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_91) v_~a$w_buff1_used~0_90)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_91} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_90} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 108#L773true, Black: 166#true, P1Thread1of1ForFork2InUse, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 5#L789true, 51#L829true, 123#L887true, 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 154#true]) [2022-12-05 22:56:55,515 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,515 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,515 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,515 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:55,717 INFO L130 PetriNetUnfolder]: 7615/11408 cut-off events. [2022-12-05 22:56:55,717 INFO L131 PetriNetUnfolder]: For 10229/11230 co-relation queries the response was YES. [2022-12-05 22:56:55,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29661 conditions, 11408 events. 7615/11408 cut-off events. For 10229/11230 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 70716 event pairs, 1689 based on Foata normal form. 446/11359 useless extension candidates. Maximal degree in co-relation 29642. Up to 9168 conditions per place. [2022-12-05 22:56:55,784 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2022-12-05 22:56:55,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 508 flow [2022-12-05 22:56:55,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-05 22:56:55,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-05 22:56:55,785 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 298 flow. Second operand 3 states and 59 transitions. [2022-12-05 22:56:55,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 508 flow [2022-12-05 22:56:55,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:55,797 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 327 flow [2022-12-05 22:56:55,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-05 22:56:55,798 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-05 22:56:55,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:55,798 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 327 flow [2022-12-05 22:56:55,800 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:55,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:55,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 327 flow [2022-12-05 22:56:55,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 327 flow [2022-12-05 22:56:55,909 INFO L130 PetriNetUnfolder]: 567/1359 cut-off events. [2022-12-05 22:56:55,909 INFO L131 PetriNetUnfolder]: For 1043/1206 co-relation queries the response was YES. [2022-12-05 22:56:55,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3342 conditions, 1359 events. 567/1359 cut-off events. For 1043/1206 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10638 event pairs, 235 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 3324. Up to 686 conditions per place. [2022-12-05 22:56:55,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 327 flow [2022-12-05 22:56:55,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 934 [2022-12-05 22:56:55,942 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:55,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-05 22:56:55,944 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 327 flow [2022-12-05 22:56:55,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-05 22:56:55,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:55,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:55,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:56:55,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:55,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2126847440, now seen corresponding path program 1 times [2022-12-05 22:56:55,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:55,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686197383] [2022-12-05 22:56:55,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:55,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:56,133 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-05 22:56:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:56,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686197383] [2022-12-05 22:56:56,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686197383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:56,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:56,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:56:56,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089826752] [2022-12-05 22:56:56,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:56,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:56,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:56,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:56,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:56:56,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:56,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:56,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:56:56,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:56,790 INFO L130 PetriNetUnfolder]: 4120/6536 cut-off events. [2022-12-05 22:56:56,791 INFO L131 PetriNetUnfolder]: For 5861/6145 co-relation queries the response was YES. [2022-12-05 22:56:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 6536 events. 4120/6536 cut-off events. For 5861/6145 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 40331 event pairs, 961 based on Foata normal form. 536/6791 useless extension candidates. Maximal degree in co-relation 19692. Up to 2484 conditions per place. [2022-12-05 22:56:56,828 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2022-12-05 22:56:56,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 97 transitions, 677 flow [2022-12-05 22:56:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:56:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:56:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-05 22:56:56,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6982758620689655 [2022-12-05 22:56:56,831 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 327 flow. Second operand 4 states and 81 transitions. [2022-12-05 22:56:56,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 97 transitions, 677 flow [2022-12-05 22:56:56,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:56,849 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 374 flow [2022-12-05 22:56:56,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2022-12-05 22:56:56,852 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-05 22:56:56,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:56,852 INFO L89 Accepts]: Start accepts. Operand has 56 places, 57 transitions, 374 flow [2022-12-05 22:56:56,855 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:56,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:56,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 57 transitions, 374 flow [2022-12-05 22:56:56,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 374 flow [2022-12-05 22:56:56,947 INFO L130 PetriNetUnfolder]: 364/944 cut-off events. [2022-12-05 22:56:56,947 INFO L131 PetriNetUnfolder]: For 1021/1315 co-relation queries the response was YES. [2022-12-05 22:56:56,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 944 events. 364/944 cut-off events. For 1021/1315 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6632 event pairs, 88 based on Foata normal form. 41/938 useless extension candidates. Maximal degree in co-relation 2877. Up to 448 conditions per place. [2022-12-05 22:56:56,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 57 transitions, 374 flow [2022-12-05 22:56:56,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-05 22:56:56,967 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:56,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-05 22:56:56,968 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 374 flow [2022-12-05 22:56:56,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:56,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:56,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:56,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:56:56,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -377031090, now seen corresponding path program 1 times [2022-12-05 22:56:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:56,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043392360] [2022-12-05 22:56:56,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:57,236 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-05 22:56:57,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:57,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043392360] [2022-12-05 22:56:57,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043392360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:57,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:57,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:56:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013114974] [2022-12-05 22:56:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:57,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:56:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:57,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:56:57,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:56:57,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:56:57,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 374 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:57,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:57,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:56:57,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:58,284 INFO L130 PetriNetUnfolder]: 8433/12515 cut-off events. [2022-12-05 22:56:58,284 INFO L131 PetriNetUnfolder]: For 27346/27346 co-relation queries the response was YES. [2022-12-05 22:56:58,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45137 conditions, 12515 events. 8433/12515 cut-off events. For 27346/27346 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 71031 event pairs, 661 based on Foata normal form. 66/12581 useless extension candidates. Maximal degree in co-relation 45114. Up to 4200 conditions per place. [2022-12-05 22:56:58,330 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 109 selfloop transitions, 39 changer transitions 24/172 dead transitions. [2022-12-05 22:56:58,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 172 transitions, 1390 flow [2022-12-05 22:56:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:56:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:56:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-05 22:56:58,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2022-12-05 22:56:58,332 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 374 flow. Second operand 6 states and 109 transitions. [2022-12-05 22:56:58,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 172 transitions, 1390 flow [2022-12-05 22:56:58,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 172 transitions, 1316 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-05 22:56:58,377 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 636 flow [2022-12-05 22:56:58,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2022-12-05 22:56:58,377 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2022-12-05 22:56:58,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:58,378 INFO L89 Accepts]: Start accepts. Operand has 61 places, 76 transitions, 636 flow [2022-12-05 22:56:58,379 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:58,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:58,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 76 transitions, 636 flow [2022-12-05 22:56:58,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 76 transitions, 636 flow [2022-12-05 22:56:58,502 INFO L130 PetriNetUnfolder]: 553/1422 cut-off events. [2022-12-05 22:56:58,503 INFO L131 PetriNetUnfolder]: For 2312/2567 co-relation queries the response was YES. [2022-12-05 22:56:58,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4335 conditions, 1422 events. 553/1422 cut-off events. For 2312/2567 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11090 event pairs, 111 based on Foata normal form. 82/1440 useless extension candidates. Maximal degree in co-relation 4313. Up to 624 conditions per place. [2022-12-05 22:56:58,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 76 transitions, 636 flow [2022-12-05 22:56:58,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 1296 [2022-12-05 22:56:58,531 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:58,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-05 22:56:58,531 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 636 flow [2022-12-05 22:56:58,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:58,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:58,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:58,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:56:58,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2103249206, now seen corresponding path program 1 times [2022-12-05 22:56:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:58,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733791621] [2022-12-05 22:56:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:58,733 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-05 22:56:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:58,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733791621] [2022-12-05 22:56:58,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733791621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:58,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:58,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:56:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934221251] [2022-12-05 22:56:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:58,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:56:58,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:58,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:56:58,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:56:58,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:56:58,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 636 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-05 22:56:58,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:58,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:56:58,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:59,307 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L829-->L845: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_50 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse4 .cse8)) (.cse12 (= 0 (mod v_~a$w_buff0_used~0_144 256))) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_125 256) 0)))) (let ((.cse10 (or .cse2 .cse12 .cse9)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (ite .cse10 v_~a~0_85 (ite .cse11 v_~a$w_buff0~0_61 v_~a$w_buff1~0_58))) (.cse3 (= (mod v_~a$w_buff0_used~0_143 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse1 v_~a$r_buff0_thd4~0_58 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse3) .cse6) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~a$r_buff1_thd4~0_50 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse7 .cse8) .cse3 (and .cse7 .cse5))) v_~a$r_buff1_thd4~0_50 0)) v_~a$r_buff1_thd4~0_49) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= v_~a~0_84 (ite .cse1 v_~a$mem_tmp~0_14 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_125 (ite (or .cse2 .cse3 .cse9) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse1 v_~a$w_buff0_used~0_144 (ite .cse10 v_~a$w_buff0_used~0_144 (ite .cse11 0 v_~a$w_buff0_used~0_144))) v_~a$w_buff0_used~0_143)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_144, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_49, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_143, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][110], [Black: 184#(= ~y~0 1), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L876-3true, 86#L845true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 166#true, 191#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), P1Thread1of1ForFork2InUse, 159#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, 119#P0EXITtrue, Black: 175#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork3InUse, 5#L789true, Black: 180#(<= ~__unbuffered_cnt~0 1), 199#(<= ~__unbuffered_cnt~0 2), Black: 156#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-05 22:56:59,308 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 22:56:59,308 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:59,308 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:59,308 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 22:56:59,417 INFO L130 PetriNetUnfolder]: 4228/6704 cut-off events. [2022-12-05 22:56:59,417 INFO L131 PetriNetUnfolder]: For 11824/12057 co-relation queries the response was YES. [2022-12-05 22:56:59,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21644 conditions, 6704 events. 4228/6704 cut-off events. For 11824/12057 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42247 event pairs, 994 based on Foata normal form. 330/6715 useless extension candidates. Maximal degree in co-relation 21619. Up to 2568 conditions per place. [2022-12-05 22:56:59,445 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 100 selfloop transitions, 13 changer transitions 2/146 dead transitions. [2022-12-05 22:56:59,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 146 transitions, 1288 flow [2022-12-05 22:56:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:56:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:56:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-05 22:56:59,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.696551724137931 [2022-12-05 22:56:59,447 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 636 flow. Second operand 5 states and 101 transitions. [2022-12-05 22:56:59,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 146 transitions, 1288 flow [2022-12-05 22:56:59,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 146 transitions, 1288 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:56:59,467 INFO L231 Difference]: Finished difference. Result has 66 places, 80 transitions, 704 flow [2022-12-05 22:56:59,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=704, PETRI_PLACES=66, PETRI_TRANSITIONS=80} [2022-12-05 22:56:59,468 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2022-12-05 22:56:59,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:59,468 INFO L89 Accepts]: Start accepts. Operand has 66 places, 80 transitions, 704 flow [2022-12-05 22:56:59,470 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:59,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:59,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 80 transitions, 704 flow [2022-12-05 22:56:59,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 80 transitions, 704 flow [2022-12-05 22:56:59,560 INFO L130 PetriNetUnfolder]: 424/1024 cut-off events. [2022-12-05 22:56:59,560 INFO L131 PetriNetUnfolder]: For 2771/3035 co-relation queries the response was YES. [2022-12-05 22:56:59,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3831 conditions, 1024 events. 424/1024 cut-off events. For 2771/3035 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7016 event pairs, 54 based on Foata normal form. 77/1059 useless extension candidates. Maximal degree in co-relation 3806. Up to 371 conditions per place. [2022-12-05 22:56:59,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 80 transitions, 704 flow [2022-12-05 22:56:59,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 1228 [2022-12-05 22:56:59,644 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:59,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-05 22:56:59,646 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 704 flow [2022-12-05 22:56:59,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-05 22:56:59,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:59,646 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:59,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:56:59,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 475068946, now seen corresponding path program 1 times [2022-12-05 22:56:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:59,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063833610] [2022-12-05 22:56:59,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:59,825 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-05 22:56:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:59,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063833610] [2022-12-05 22:56:59,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063833610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:59,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:59,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:56:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291911210] [2022-12-05 22:56:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:59,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:56:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:56:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:56:59,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 22:56:59,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 704 flow. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:59,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:59,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 22:56:59,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:01,076 INFO L130 PetriNetUnfolder]: 8556/12875 cut-off events. [2022-12-05 22:57:01,076 INFO L131 PetriNetUnfolder]: For 41825/41825 co-relation queries the response was YES. [2022-12-05 22:57:01,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50659 conditions, 12875 events. 8556/12875 cut-off events. For 41825/41825 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 76461 event pairs, 1791 based on Foata normal form. 13/12888 useless extension candidates. Maximal degree in co-relation 50631. Up to 5785 conditions per place. [2022-12-05 22:57:01,128 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 99 selfloop transitions, 26 changer transitions 38/163 dead transitions. [2022-12-05 22:57:01,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 163 transitions, 1624 flow [2022-12-05 22:57:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:57:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:57:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-05 22:57:01,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2022-12-05 22:57:01,130 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 704 flow. Second operand 4 states and 78 transitions. [2022-12-05 22:57:01,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 163 transitions, 1624 flow [2022-12-05 22:57:01,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 163 transitions, 1526 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-05 22:57:01,388 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 699 flow [2022-12-05 22:57:01,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=699, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2022-12-05 22:57:01,389 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2022-12-05 22:57:01,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:01,389 INFO L89 Accepts]: Start accepts. Operand has 69 places, 75 transitions, 699 flow [2022-12-05 22:57:01,390 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:01,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:01,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 75 transitions, 699 flow [2022-12-05 22:57:01,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 699 flow [2022-12-05 22:57:01,499 INFO L130 PetriNetUnfolder]: 417/1120 cut-off events. [2022-12-05 22:57:01,500 INFO L131 PetriNetUnfolder]: For 2776/2963 co-relation queries the response was YES. [2022-12-05 22:57:01,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 1120 events. 417/1120 cut-off events. For 2776/2963 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8447 event pairs, 46 based on Foata normal form. 84/1157 useless extension candidates. Maximal degree in co-relation 3783. Up to 340 conditions per place. [2022-12-05 22:57:01,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 75 transitions, 699 flow [2022-12-05 22:57:01,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-05 22:57:01,518 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:57:01,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-05 22:57:01,519 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 699 flow [2022-12-05 22:57:01,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:01,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:01,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:01,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:57:01,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:57:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 503937636, now seen corresponding path program 1 times [2022-12-05 22:57:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:01,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736557493] [2022-12-05 22:57:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:02,441 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-05 22:57:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:02,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736557493] [2022-12-05 22:57:02,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736557493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:02,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:02,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:57:02,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086087941] [2022-12-05 22:57:02,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:02,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:57:02,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:02,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:57:02,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:57:02,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:57:02,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 699 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-05 22:57:02,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:02,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:57:02,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:03,525 INFO L130 PetriNetUnfolder]: 6536/11120 cut-off events. [2022-12-05 22:57:03,526 INFO L131 PetriNetUnfolder]: For 26086/26727 co-relation queries the response was YES. [2022-12-05 22:57:03,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38138 conditions, 11120 events. 6536/11120 cut-off events. For 26086/26727 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 82737 event pairs, 1219 based on Foata normal form. 88/10956 useless extension candidates. Maximal degree in co-relation 38107. Up to 5305 conditions per place. [2022-12-05 22:57:03,569 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 130 selfloop transitions, 9 changer transitions 27/189 dead transitions. [2022-12-05 22:57:03,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 189 transitions, 1830 flow [2022-12-05 22:57:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:57:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:57:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-05 22:57:03,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2022-12-05 22:57:03,571 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 699 flow. Second operand 6 states and 113 transitions. [2022-12-05 22:57:03,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 189 transitions, 1830 flow [2022-12-05 22:57:04,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 189 transitions, 1816 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-05 22:57:04,017 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 765 flow [2022-12-05 22:57:04,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2022-12-05 22:57:04,018 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2022-12-05 22:57:04,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:04,018 INFO L89 Accepts]: Start accepts. Operand has 78 places, 83 transitions, 765 flow [2022-12-05 22:57:04,019 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:04,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:04,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 83 transitions, 765 flow [2022-12-05 22:57:04,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 83 transitions, 765 flow [2022-12-05 22:57:04,253 INFO L130 PetriNetUnfolder]: 1403/3609 cut-off events. [2022-12-05 22:57:04,253 INFO L131 PetriNetUnfolder]: For 6212/6847 co-relation queries the response was YES. [2022-12-05 22:57:04,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11240 conditions, 3609 events. 1403/3609 cut-off events. For 6212/6847 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 33967 event pairs, 178 based on Foata normal form. 316/3683 useless extension candidates. Maximal degree in co-relation 11206. Up to 1294 conditions per place. [2022-12-05 22:57:04,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 83 transitions, 765 flow [2022-12-05 22:57:04,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 1342 [2022-12-05 22:57:04,290 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:57:04,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-05 22:57:04,291 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 765 flow [2022-12-05 22:57:04,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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-05 22:57:04,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:04,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:04,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:57:04,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:57:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -104268896, now seen corresponding path program 2 times [2022-12-05 22:57:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:04,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141759282] [2022-12-05 22:57:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:57:04,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:04,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141759282] [2022-12-05 22:57:04,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141759282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:04,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:04,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:57:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242089752] [2022-12-05 22:57:04,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:04,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:57:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:04,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:57:04,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:57:04,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-05 22:57:04,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 765 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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-05 22:57:04,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:04,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-05 22:57:04,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:05,591 INFO L130 PetriNetUnfolder]: 6263/10470 cut-off events. [2022-12-05 22:57:05,591 INFO L131 PetriNetUnfolder]: For 30711/31470 co-relation queries the response was YES. [2022-12-05 22:57:05,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41787 conditions, 10470 events. 6263/10470 cut-off events. For 30711/31470 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 77401 event pairs, 870 based on Foata normal form. 260/10462 useless extension candidates. Maximal degree in co-relation 41750. Up to 4141 conditions per place. [2022-12-05 22:57:05,634 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 66 selfloop transitions, 17 changer transitions 62/155 dead transitions. [2022-12-05 22:57:05,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 155 transitions, 1613 flow [2022-12-05 22:57:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:57:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:57:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-05 22:57:05,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2022-12-05 22:57:05,636 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 765 flow. Second operand 6 states and 106 transitions. [2022-12-05 22:57:05,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 155 transitions, 1613 flow [2022-12-05 22:57:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 155 transitions, 1591 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 22:57:06,102 INFO L231 Difference]: Finished difference. Result has 81 places, 55 transitions, 460 flow [2022-12-05 22:57:06,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=81, PETRI_TRANSITIONS=55} [2022-12-05 22:57:06,103 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2022-12-05 22:57:06,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:06,103 INFO L89 Accepts]: Start accepts. Operand has 81 places, 55 transitions, 460 flow [2022-12-05 22:57:06,104 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:06,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:06,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 55 transitions, 460 flow [2022-12-05 22:57:06,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 55 transitions, 460 flow [2022-12-05 22:57:06,143 INFO L130 PetriNetUnfolder]: 235/581 cut-off events. [2022-12-05 22:57:06,144 INFO L131 PetriNetUnfolder]: For 1103/1233 co-relation queries the response was YES. [2022-12-05 22:57:06,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 581 events. 235/581 cut-off events. For 1103/1233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3522 event pairs, 30 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 2129. Up to 212 conditions per place. [2022-12-05 22:57:06,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 55 transitions, 460 flow [2022-12-05 22:57:06,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-05 22:57:06,825 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:57:06,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-05 22:57:06,826 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 465 flow [2022-12-05 22:57:06,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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-05 22:57:06,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:06,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:06,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:57:06,827 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:57:06,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash -502379983, now seen corresponding path program 1 times [2022-12-05 22:57:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:06,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87321670] [2022-12-05 22:57:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:57:07,022 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-05 22:57:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:57:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87321670] [2022-12-05 22:57:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87321670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:57:07,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:57:07,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:57:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701605824] [2022-12-05 22:57:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:57:07,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:57:07,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:57:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:57:07,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:57:07,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 22:57:07,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 465 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:07,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:57:07,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 22:57:07,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:57:07,503 INFO L130 PetriNetUnfolder]: 1874/3092 cut-off events. [2022-12-05 22:57:07,503 INFO L131 PetriNetUnfolder]: For 16157/16157 co-relation queries the response was YES. [2022-12-05 22:57:07,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14629 conditions, 3092 events. 1874/3092 cut-off events. For 16157/16157 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16828 event pairs, 459 based on Foata normal form. 2/3094 useless extension candidates. Maximal degree in co-relation 14592. Up to 1760 conditions per place. [2022-12-05 22:57:07,522 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 56 selfloop transitions, 4 changer transitions 29/89 dead transitions. [2022-12-05 22:57:07,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 885 flow [2022-12-05 22:57:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:57:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:57:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-05 22:57:07,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2022-12-05 22:57:07,523 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 465 flow. Second operand 4 states and 56 transitions. [2022-12-05 22:57:07,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 885 flow [2022-12-05 22:57:07,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 733 flow, removed 29 selfloop flow, removed 11 redundant places. [2022-12-05 22:57:07,564 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 253 flow [2022-12-05 22:57:07,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2022-12-05 22:57:07,564 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2022-12-05 22:57:07,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:57:07,565 INFO L89 Accepts]: Start accepts. Operand has 69 places, 40 transitions, 253 flow [2022-12-05 22:57:07,566 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:57:07,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:57:07,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 40 transitions, 253 flow [2022-12-05 22:57:07,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 40 transitions, 253 flow [2022-12-05 22:57:07,586 INFO L130 PetriNetUnfolder]: 91/223 cut-off events. [2022-12-05 22:57:07,586 INFO L131 PetriNetUnfolder]: For 562/628 co-relation queries the response was YES. [2022-12-05 22:57:07,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 223 events. 91/223 cut-off events. For 562/628 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 952 event pairs, 11 based on Foata normal form. 7/203 useless extension candidates. Maximal degree in co-relation 667. Up to 79 conditions per place. [2022-12-05 22:57:07,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 40 transitions, 253 flow [2022-12-05 22:57:07,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-05 22:57:08,306 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:57:08,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 742 [2022-12-05 22:57:08,307 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 36 transitions, 237 flow [2022-12-05 22:57:08,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:57:08,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:57:08,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:08,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:57:08,307 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:57:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:57:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash -345714816, now seen corresponding path program 1 times [2022-12-05 22:57:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:57:08,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225845604] [2022-12-05 22:57:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:57:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:57:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:57:08,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:57:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:57:08,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:57:08,505 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:57:08,505 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 22:57:08,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 22:57:08,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 22:57:08,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 22:57:08,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 22:57:08,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 22:57:08,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 22:57:08,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 22:57:08,508 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:57:08,513 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:57:08,513 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:57:08,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:57:08 BasicIcfg [2022-12-05 22:57:08,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:57:08,621 INFO L158 Benchmark]: Toolchain (without parser) took 30973.81ms. Allocated memory was 183.5MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 148.9MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 818.9MB. Max. memory is 8.0GB. [2022-12-05 22:57:08,621 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 160.8MB in the beginning and 160.7MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:57:08,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.44ms. Allocated memory is still 183.5MB. Free memory was 148.4MB in the beginning and 120.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:57:08,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.92ms. Allocated memory is still 183.5MB. Free memory was 120.0MB in the beginning and 117.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:57:08,622 INFO L158 Benchmark]: Boogie Preprocessor took 54.76ms. Allocated memory is still 183.5MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:57:08,622 INFO L158 Benchmark]: RCFGBuilder took 639.09ms. Allocated memory is still 183.5MB. Free memory was 115.3MB in the beginning and 77.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 22:57:08,622 INFO L158 Benchmark]: TraceAbstraction took 29654.96ms. Allocated memory was 183.5MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 77.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 746.5MB. Max. memory is 8.0GB. [2022-12-05 22:57:08,624 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 183.5MB. Free memory was 160.8MB in the beginning and 160.7MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 559.44ms. Allocated memory is still 183.5MB. Free memory was 148.4MB in the beginning and 120.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.92ms. Allocated memory is still 183.5MB. Free memory was 120.0MB in the beginning and 117.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.76ms. Allocated memory is still 183.5MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 639.09ms. Allocated memory is still 183.5MB. Free memory was 115.3MB in the beginning and 77.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 29654.96ms. Allocated memory was 183.5MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 77.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 746.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 139 PlacesBefore, 49 PlacesAfterwards, 128 TransitionsBefore, 37 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 2263, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1809, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1809, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 225, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2340, independent: 500, independent conditional: 0, independent unconditional: 500, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 1809, unknown conditional: 0, unknown unconditional: 1809] , Statistics on independence cache: Total cache size (in pairs): 2677, Positive cache size: 2631, Positive conditional cache size: 0, Positive unconditional cache size: 2631, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 160, independent conditional: 160, 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: 192, independent: 160, independent conditional: 27, independent unconditional: 133, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 160, independent conditional: 27, independent unconditional: 133, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 160, independent conditional: 27, independent unconditional: 133, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 175, independent: 148, independent conditional: 24, independent unconditional: 124, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 175, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 100, dependent conditional: 60, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 192, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 175, unknown conditional: 34, unknown unconditional: 141] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 148, Positive conditional cache size: 24, Positive unconditional cache size: 124, Negative cache size: 27, Negative conditional cache size: 10, Negative unconditional cache size: 17, 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, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 153, independent: 138, independent conditional: 26, independent unconditional: 112, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 138, independent conditional: 8, independent unconditional: 130, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 138, independent conditional: 8, independent unconditional: 130, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 120, independent conditional: 7, independent unconditional: 113, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 24, unknown conditional: 1, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 166, Positive conditional cache size: 25, Positive unconditional cache size: 141, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 159, independent conditional: 21, independent unconditional: 138, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 159, independent conditional: 7, independent unconditional: 152, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 159, independent conditional: 7, independent unconditional: 152, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 152, independent conditional: 7, independent unconditional: 145, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 173, Positive conditional cache size: 25, Positive unconditional cache size: 148, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 173, independent conditional: 173, 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: 203, independent: 173, independent conditional: 27, independent unconditional: 146, 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: 203, independent: 173, independent conditional: 1, independent unconditional: 172, 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: 203, independent: 173, independent conditional: 1, independent unconditional: 172, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 171, independent conditional: 1, independent unconditional: 170, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 175, Positive conditional cache size: 25, Positive unconditional cache size: 150, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 934 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 175, Positive conditional cache size: 25, Positive unconditional cache size: 150, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1070 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 115, 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: 147, independent: 115, independent conditional: 5, independent unconditional: 110, 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: 147, independent: 115, independent conditional: 5, independent unconditional: 110, 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: 147, independent: 115, independent conditional: 5, independent unconditional: 110, 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: 147, independent: 115, independent conditional: 5, independent unconditional: 110, 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): 210, Positive cache size: 175, Positive conditional cache size: 25, Positive unconditional cache size: 150, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 248, independent: 211, independent conditional: 99, independent unconditional: 112, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, independent: 211, independent conditional: 32, independent unconditional: 179, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, independent: 211, independent conditional: 32, independent unconditional: 179, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, independent: 206, independent conditional: 32, independent unconditional: 174, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 180, Positive conditional cache size: 25, Positive unconditional cache size: 155, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 66 PlacesBefore, 66 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 248, independent: 204, independent conditional: 44, independent unconditional: 160, dependent: 44, dependent conditional: 18, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 284, independent: 204, independent conditional: 8, independent unconditional: 196, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 284, independent: 204, independent conditional: 8, independent unconditional: 196, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 8, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 61, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 284, independent: 201, independent conditional: 8, independent unconditional: 193, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 183, Positive conditional cache size: 25, Positive unconditional cache size: 158, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1070 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 163, independent: 127, independent conditional: 61, independent unconditional: 66, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 127, independent conditional: 49, independent unconditional: 78, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 127, independent conditional: 49, independent unconditional: 78, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 123, independent conditional: 46, independent unconditional: 77, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 187, Positive conditional cache size: 28, Positive unconditional cache size: 159, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, 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, 78 PlacesBefore, 78 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 192, Positive conditional cache size: 30, Positive unconditional cache size: 162, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 79 PlacesBefore, 76 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 86, 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: 86, independent: 86, independent conditional: 56, independent unconditional: 30, 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: 86, independent: 86, independent conditional: 54, independent unconditional: 32, 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: 86, independent: 86, independent conditional: 54, independent unconditional: 32, 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: 18, independent: 18, independent conditional: 8, independent unconditional: 10, 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: 18, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 68, independent conditional: 46, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 8, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 295, Positive conditional cache size: 46, Positive unconditional cache size: 249, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 67 PlacesBefore, 63 PlacesAfterwards, 40 TransitionsBefore, 36 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 39, independent unconditional: 3, 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: 42, independent: 42, independent conditional: 23, independent unconditional: 19, 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: 42, independent: 42, independent conditional: 23, independent unconditional: 19, 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: 22, independent: 22, independent conditional: 10, independent unconditional: 12, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 42, independent: 20, independent conditional: 13, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 10, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 354, Positive conditional cache size: 62, Positive unconditional cache size: 292, Negative cache size: 40, Negative conditional cache size: 10, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 [L785] 2 __unbuffered_p1_EAX = x [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 [L828] 4 __unbuffered_p3_EAX = z [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1184 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 41 mSDtfsCounter, 1184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=765occurred in iteration=10, InterpolantAutomatonStates: 52, 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.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397 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-05 22:57:08,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...