/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/rfi009_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:47:22,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:47:22,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:47:22,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:47:22,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:47:22,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:47:22,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:47:22,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:47:22,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:47:22,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:47:22,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:47:22,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:47:22,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:47:22,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:47:22,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:47:22,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:47:22,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:47:22,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:47:22,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:47:22,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:47:22,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:47:22,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:47:22,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:47:22,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:47:22,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:47:22,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:47:22,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:47:22,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:47:22,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:47:22,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:47:22,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:47:22,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:47:22,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:47:22,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:47:22,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:47:22,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:47:22,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:47:22,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:47:22,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:47:22,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:47:22,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:47:22,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:47:22,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:47:22,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:47:22,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:47:22,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:47:22,992 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:47:22,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:47:22,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:47:22,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:47:22,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:47:22,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:47:22,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:47:22,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:47:22,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:47:22,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:47:22,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:47:22,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:47:22,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:47:22,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:47:22,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:47:22,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:47:22,996 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:47:22,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:47:23,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:47:23,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:47:23,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:47:23,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:47:23,298 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:47:23,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2022-12-13 00:47:24,298 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:47:24,558 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:47:24,558 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2022-12-13 00:47:24,580 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9704c21/7ef1644f06ac4ed49758b6a85000735f/FLAG85b0fe874 [2022-12-13 00:47:24,594 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9704c21/7ef1644f06ac4ed49758b6a85000735f [2022-12-13 00:47:24,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:47:24,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:47:24,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:47:24,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:47:24,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:47:24,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:47:24" (1/1) ... [2022-12-13 00:47:24,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7961c14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:24, skipping insertion in model container [2022-12-13 00:47:24,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:47:24" (1/1) ... [2022-12-13 00:47:24,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:47:24,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:47:24,766 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/rfi009_rmo.oepc.i[992,1005] [2022-12-13 00:47:24,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:24,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:24,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:47:24,969 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:47:24,978 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/rfi009_rmo.oepc.i[992,1005] [2022-12-13 00:47:25,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:47:25,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:47:25,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:47:25,104 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:47:25,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25 WrapperNode [2022-12-13 00:47:25,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:47:25,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:47:25,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:47:25,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:47:25,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,165 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 00:47:25,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:47:25,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:47:25,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:47:25,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:47:25,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,189 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:47:25,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:47:25,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:47:25,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:47:25,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (1/1) ... [2022-12-13 00:47:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:47:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:47:25,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:47:25,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:47:25,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:47:25,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:47:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:47:25,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:47:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:47:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:47:25,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:47:25,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:47:25,247 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:47:25,344 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:47:25,345 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:47:25,724 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:47:25,897 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:47:25,897 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:47:25,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:47:25 BoogieIcfgContainer [2022-12-13 00:47:25,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:47:25,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:47:25,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:47:25,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:47:25,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:47:24" (1/3) ... [2022-12-13 00:47:25,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bafbac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:47:25, skipping insertion in model container [2022-12-13 00:47:25,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:47:25" (2/3) ... [2022-12-13 00:47:25,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bafbac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:47:25, skipping insertion in model container [2022-12-13 00:47:25,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:47:25" (3/3) ... [2022-12-13 00:47:25,907 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2022-12-13 00:47:25,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:47:25,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:47:25,920 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:47:25,967 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:47:25,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:47:26,048 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 00:47:26,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:26,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-13 00:47:26,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:47:26,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:26,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:26,077 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:26,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:26,096 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 00:47:26,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:26,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 37 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 00:47:26,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:47:26,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 00:47:32,161 INFO L241 LiptonReduction]: Total number of compositions: 92 [2022-12-13 00:47:32,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:47:32,188 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;@56d293ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:47:32,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:47:32,194 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 00:47:32,195 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:32,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:32,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:32,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2123358374, now seen corresponding path program 1 times [2022-12-13 00:47:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:32,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337191762] [2022-12-13 00:47:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:32,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337191762] [2022-12-13 00:47:32,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337191762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:32,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:32,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:47:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151489231] [2022-12-13 00:47:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:32,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:47:32,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:32,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:47:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:47:32,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 00:47:32,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:32,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:32,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 00:47:32,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:32,703 INFO L130 PetriNetUnfolder]: 909/1417 cut-off events. [2022-12-13 00:47:32,703 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 00:47:32,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 1417 events. 909/1417 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6943 event pairs, 909 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 2819. Up to 1359 conditions per place. [2022-12-13 00:47:32,717 INFO L137 encePairwiseOnDemand]: 28/29 looper letters, 20 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2022-12-13 00:47:32,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 105 flow [2022-12-13 00:47:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:47:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:47:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2022-12-13 00:47:32,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-13 00:47:32,727 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 2 states and 37 transitions. [2022-12-13 00:47:32,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 105 flow [2022-12-13 00:47:32,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:32,730 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2022-12-13 00:47:32,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-13 00:47:32,736 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-13 00:47:32,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:32,737 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 62 flow [2022-12-13 00:47:32,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:32,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:32,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 62 flow [2022-12-13 00:47:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 62 flow [2022-12-13 00:47:32,745 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:47:32,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:32,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:47:32,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 62 flow [2022-12-13 00:47:32,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-13 00:47:32,916 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:32,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-13 00:47:32,919 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 62 flow [2022-12-13 00:47:32,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:32,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:32,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:32,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:47:32,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash 437950266, now seen corresponding path program 1 times [2022-12-13 00:47:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:32,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224988471] [2022-12-13 00:47:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:33,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:33,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224988471] [2022-12-13 00:47:33,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224988471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:33,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:33,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:47:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262618967] [2022-12-13 00:47:33,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:33,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:47:33,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:33,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:47:33,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:47:33,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2022-12-13 00:47:33,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:33,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:33,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2022-12-13 00:47:33,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:33,369 INFO L130 PetriNetUnfolder]: 1005/1601 cut-off events. [2022-12-13 00:47:33,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:33,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1601 events. 1005/1601 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8437 event pairs, 293 based on Foata normal form. 40/1340 useless extension candidates. Maximal degree in co-relation 3155. Up to 1125 conditions per place. [2022-12-13 00:47:33,377 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 30 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-13 00:47:33,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 150 flow [2022-12-13 00:47:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:47:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:47:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-13 00:47:33,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 00:47:33,379 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 62 flow. Second operand 3 states and 54 transitions. [2022-12-13 00:47:33,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 150 flow [2022-12-13 00:47:33,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:47:33,381 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 70 flow [2022-12-13 00:47:33,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-13 00:47:33,382 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2022-12-13 00:47:33,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:33,382 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 70 flow [2022-12-13 00:47:33,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:33,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:33,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 70 flow [2022-12-13 00:47:33,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 70 flow [2022-12-13 00:47:33,390 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:47:33,390 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:47:33,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:47:33,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 70 flow [2022-12-13 00:47:33,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-13 00:47:33,428 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:47:33,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 00:47:33,430 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 68 flow [2022-12-13 00:47:33,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:33,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:33,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:33,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:47:33,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 781027356, now seen corresponding path program 1 times [2022-12-13 00:47:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:33,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302544982] [2022-12-13 00:47:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:33,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302544982] [2022-12-13 00:47:33,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302544982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:33,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:33,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:47:33,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580043988] [2022-12-13 00:47:33,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:33,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:47:33,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:33,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:47:33,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:47:33,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 00:47:33,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:33,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:33,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 00:47:33,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:33,853 INFO L130 PetriNetUnfolder]: 807/1407 cut-off events. [2022-12-13 00:47:33,853 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-13 00:47:33,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2874 conditions, 1407 events. 807/1407 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7762 event pairs, 144 based on Foata normal form. 20/1165 useless extension candidates. Maximal degree in co-relation 2863. Up to 1025 conditions per place. [2022-12-13 00:47:33,860 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 32 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-13 00:47:33,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 171 flow [2022-12-13 00:47:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:47:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:47:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 00:47:33,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2022-12-13 00:47:33,862 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 68 flow. Second operand 3 states and 56 transitions. [2022-12-13 00:47:33,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 171 flow [2022-12-13 00:47:33,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:33,864 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 72 flow [2022-12-13 00:47:33,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-13 00:47:33,865 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2022-12-13 00:47:33,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:33,865 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 72 flow [2022-12-13 00:47:33,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:33,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:33,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 72 flow [2022-12-13 00:47:33,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 72 flow [2022-12-13 00:47:33,870 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 00:47:33,870 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:47:33,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 27 events. 0/27 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:47:33,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 72 flow [2022-12-13 00:47:33,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 00:47:33,874 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:33,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 00:47:33,875 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 72 flow [2022-12-13 00:47:33,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:33,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:33,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:33,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:47:33,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1557957004, now seen corresponding path program 1 times [2022-12-13 00:47:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:33,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284947905] [2022-12-13 00:47:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:34,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284947905] [2022-12-13 00:47:34,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284947905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:34,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:34,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:47:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12237028] [2022-12-13 00:47:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:34,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:47:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:47:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:47:34,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 00:47:34,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:34,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:34,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 00:47:34,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:34,983 INFO L130 PetriNetUnfolder]: 871/1430 cut-off events. [2022-12-13 00:47:34,984 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-13 00:47:34,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3194 conditions, 1430 events. 871/1430 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7486 event pairs, 187 based on Foata normal form. 3/1160 useless extension candidates. Maximal degree in co-relation 3182. Up to 1147 conditions per place. [2022-12-13 00:47:34,990 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 34 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2022-12-13 00:47:34,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 215 flow [2022-12-13 00:47:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:47:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:47:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 00:47:34,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-13 00:47:34,992 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 72 flow. Second operand 4 states and 71 transitions. [2022-12-13 00:47:34,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 215 flow [2022-12-13 00:47:35,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:35,009 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 122 flow [2022-12-13 00:47:35,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-13 00:47:35,009 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 00:47:35,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:35,010 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 122 flow [2022-12-13 00:47:35,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:35,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:35,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 122 flow [2022-12-13 00:47:35,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 122 flow [2022-12-13 00:47:35,021 INFO L130 PetriNetUnfolder]: 8/78 cut-off events. [2022-12-13 00:47:35,021 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-12-13 00:47:35,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 78 events. 8/78 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 365 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 131. Up to 13 conditions per place. [2022-12-13 00:47:35,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 122 flow [2022-12-13 00:47:35,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 00:47:35,079 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:35,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 00:47:35,080 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 122 flow [2022-12-13 00:47:35,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:35,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:35,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:35,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:47:35,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1232910428, now seen corresponding path program 2 times [2022-12-13 00:47:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:35,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821633425] [2022-12-13 00:47:35,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:35,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821633425] [2022-12-13 00:47:35,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821633425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:35,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:35,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108719033] [2022-12-13 00:47:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:35,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:35,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 00:47:35,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:35,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:35,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 00:47:35,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:36,111 INFO L130 PetriNetUnfolder]: 842/1387 cut-off events. [2022-12-13 00:47:36,111 INFO L131 PetriNetUnfolder]: For 584/584 co-relation queries the response was YES. [2022-12-13 00:47:36,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1387 events. 842/1387 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7213 event pairs, 104 based on Foata normal form. 12/1132 useless extension candidates. Maximal degree in co-relation 3423. Up to 943 conditions per place. [2022-12-13 00:47:36,118 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 38 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-13 00:47:36,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 271 flow [2022-12-13 00:47:36,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:47:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:47:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-13 00:47:36,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 00:47:36,120 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 122 flow. Second operand 4 states and 69 transitions. [2022-12-13 00:47:36,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 271 flow [2022-12-13 00:47:36,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:47:36,122 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 166 flow [2022-12-13 00:47:36,123 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-13 00:47:36,123 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 00:47:36,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:36,123 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 166 flow [2022-12-13 00:47:36,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:36,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:36,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 166 flow [2022-12-13 00:47:36,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 166 flow [2022-12-13 00:47:36,135 INFO L130 PetriNetUnfolder]: 10/80 cut-off events. [2022-12-13 00:47:36,135 INFO L131 PetriNetUnfolder]: For 40/44 co-relation queries the response was YES. [2022-12-13 00:47:36,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 80 events. 10/80 cut-off events. For 40/44 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 355 event pairs, 1 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 159. Up to 13 conditions per place. [2022-12-13 00:47:36,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 166 flow [2022-12-13 00:47:36,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 00:47:36,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:36,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 00:47:36,237 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 166 flow [2022-12-13 00:47:36,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:36,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:36,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:36,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:47:36,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1052027357, now seen corresponding path program 1 times [2022-12-13 00:47:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:36,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119725546] [2022-12-13 00:47:36,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:36,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119725546] [2022-12-13 00:47:36,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119725546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:36,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:36,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:47:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965979102] [2022-12-13 00:47:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:36,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:47:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:47:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:47:36,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:47:36,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 00:47:36,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:36,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:47:36,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:36,726 INFO L130 PetriNetUnfolder]: 1641/2554 cut-off events. [2022-12-13 00:47:36,726 INFO L131 PetriNetUnfolder]: For 1919/1919 co-relation queries the response was YES. [2022-12-13 00:47:36,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 2554 events. 1641/2554 cut-off events. For 1919/1919 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 13995 event pairs, 423 based on Foata normal form. 188/1877 useless extension candidates. Maximal degree in co-relation 6899. Up to 1975 conditions per place. [2022-12-13 00:47:36,738 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 48 selfloop transitions, 10 changer transitions 43/105 dead transitions. [2022-12-13 00:47:36,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 105 transitions, 662 flow [2022-12-13 00:47:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-13 00:47:36,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6814814814814815 [2022-12-13 00:47:36,741 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 166 flow. Second operand 5 states and 92 transitions. [2022-12-13 00:47:36,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 105 transitions, 662 flow [2022-12-13 00:47:36,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 105 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:47:36,744 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 250 flow [2022-12-13 00:47:36,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2022-12-13 00:47:36,745 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-13 00:47:36,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:36,745 INFO L89 Accepts]: Start accepts. Operand has 52 places, 46 transitions, 250 flow [2022-12-13 00:47:36,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:36,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:36,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 250 flow [2022-12-13 00:47:36,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 250 flow [2022-12-13 00:47:36,824 INFO L130 PetriNetUnfolder]: 460/875 cut-off events. [2022-12-13 00:47:36,824 INFO L131 PetriNetUnfolder]: For 742/998 co-relation queries the response was YES. [2022-12-13 00:47:36,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 875 events. 460/875 cut-off events. For 742/998 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 5476 event pairs, 226 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 2663. Up to 658 conditions per place. [2022-12-13 00:47:36,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 250 flow [2022-12-13 00:47:36,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 00:47:36,834 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:36,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 00:47:36,835 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 250 flow [2022-12-13 00:47:36,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 00:47:36,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:36,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:36,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:47:36,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1441388794, now seen corresponding path program 1 times [2022-12-13 00:47:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000551089] [2022-12-13 00:47:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:36,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:36,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000551089] [2022-12-13 00:47:36,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000551089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:36,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:36,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:47:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490522853] [2022-12-13 00:47:36,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:47:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:47:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:47:36,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 00:47:36,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:36,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:36,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 00:47:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:37,368 INFO L130 PetriNetUnfolder]: 2206/3514 cut-off events. [2022-12-13 00:47:37,368 INFO L131 PetriNetUnfolder]: For 4511/4703 co-relation queries the response was YES. [2022-12-13 00:47:37,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12742 conditions, 3514 events. 2206/3514 cut-off events. For 4511/4703 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20156 event pairs, 489 based on Foata normal form. 129/2952 useless extension candidates. Maximal degree in co-relation 12720. Up to 2100 conditions per place. [2022-12-13 00:47:37,385 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 77 selfloop transitions, 2 changer transitions 2/90 dead transitions. [2022-12-13 00:47:37,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 649 flow [2022-12-13 00:47:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:47:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:47:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 00:47:37,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-13 00:47:37,386 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 250 flow. Second operand 4 states and 71 transitions. [2022-12-13 00:47:37,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 649 flow [2022-12-13 00:47:37,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 623 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:37,411 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 251 flow [2022-12-13 00:47:37,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-13 00:47:37,412 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-13 00:47:37,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:37,412 INFO L89 Accepts]: Start accepts. Operand has 53 places, 47 transitions, 251 flow [2022-12-13 00:47:37,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:37,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:37,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 251 flow [2022-12-13 00:47:37,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 251 flow [2022-12-13 00:47:37,509 INFO L130 PetriNetUnfolder]: 923/1669 cut-off events. [2022-12-13 00:47:37,509 INFO L131 PetriNetUnfolder]: For 1231/1673 co-relation queries the response was YES. [2022-12-13 00:47:37,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4877 conditions, 1669 events. 923/1669 cut-off events. For 1231/1673 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 11523 event pairs, 461 based on Foata normal form. 1/816 useless extension candidates. Maximal degree in co-relation 4857. Up to 1336 conditions per place. [2022-12-13 00:47:37,519 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 251 flow [2022-12-13 00:47:37,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-13 00:47:37,523 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:37,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 00:47:37,524 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 251 flow [2022-12-13 00:47:37,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:37,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:37,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:37,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:47:37,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1044168968, now seen corresponding path program 2 times [2022-12-13 00:47:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:37,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604556096] [2022-12-13 00:47:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:37,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604556096] [2022-12-13 00:47:37,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604556096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:37,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:37,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:47:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661550088] [2022-12-13 00:47:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:37,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:47:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:47:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:47:37,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:47:37,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:37,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:37,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:47:37,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:37,973 INFO L130 PetriNetUnfolder]: 1678/2912 cut-off events. [2022-12-13 00:47:37,973 INFO L131 PetriNetUnfolder]: For 2775/2775 co-relation queries the response was YES. [2022-12-13 00:47:37,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10914 conditions, 2912 events. 1678/2912 cut-off events. For 2775/2775 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 18493 event pairs, 160 based on Foata normal form. 285/2173 useless extension candidates. Maximal degree in co-relation 10891. Up to 1798 conditions per place. [2022-12-13 00:47:37,986 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 55 selfloop transitions, 19 changer transitions 35/114 dead transitions. [2022-12-13 00:47:37,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 114 transitions, 845 flow [2022-12-13 00:47:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:47:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:47:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-13 00:47:37,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2022-12-13 00:47:37,988 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 251 flow. Second operand 6 states and 112 transitions. [2022-12-13 00:47:37,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 114 transitions, 845 flow [2022-12-13 00:47:37,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 838 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 00:47:38,000 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 400 flow [2022-12-13 00:47:38,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-12-13 00:47:38,001 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 00:47:38,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:38,001 INFO L89 Accepts]: Start accepts. Operand has 60 places, 56 transitions, 400 flow [2022-12-13 00:47:38,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:38,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:38,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions, 400 flow [2022-12-13 00:47:38,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 400 flow [2022-12-13 00:47:38,093 INFO L130 PetriNetUnfolder]: 545/1168 cut-off events. [2022-12-13 00:47:38,093 INFO L131 PetriNetUnfolder]: For 1520/2326 co-relation queries the response was YES. [2022-12-13 00:47:38,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 1168 events. 545/1168 cut-off events. For 1520/2326 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 8153 event pairs, 110 based on Foata normal form. 7/627 useless extension candidates. Maximal degree in co-relation 5184. Up to 895 conditions per place. [2022-12-13 00:47:38,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 400 flow [2022-12-13 00:47:38,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-13 00:47:38,103 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:38,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 00:47:38,104 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 400 flow [2022-12-13 00:47:38,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:38,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:38,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:38,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:47:38,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash -741200609, now seen corresponding path program 1 times [2022-12-13 00:47:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:38,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984017348] [2022-12-13 00:47:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:38,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984017348] [2022-12-13 00:47:38,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984017348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:38,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:38,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688573867] [2022-12-13 00:47:38,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:38,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:47:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:38,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:47:38,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:47:38,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:47:38,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:38,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:38,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:47:38,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:38,482 INFO L130 PetriNetUnfolder]: 856/1642 cut-off events. [2022-12-13 00:47:38,482 INFO L131 PetriNetUnfolder]: For 2119/2119 co-relation queries the response was YES. [2022-12-13 00:47:38,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7803 conditions, 1642 events. 856/1642 cut-off events. For 2119/2119 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10347 event pairs, 25 based on Foata normal form. 180/1257 useless extension candidates. Maximal degree in co-relation 7776. Up to 1009 conditions per place. [2022-12-13 00:47:38,494 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 41 selfloop transitions, 28 changer transitions 22/94 dead transitions. [2022-12-13 00:47:38,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 817 flow [2022-12-13 00:47:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-13 00:47:38,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-13 00:47:38,495 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 400 flow. Second operand 7 states and 102 transitions. [2022-12-13 00:47:38,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 817 flow [2022-12-13 00:47:38,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 94 transitions, 691 flow, removed 41 selfloop flow, removed 7 redundant places. [2022-12-13 00:47:38,517 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 364 flow [2022-12-13 00:47:38,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2022-12-13 00:47:38,518 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 00:47:38,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:38,518 INFO L89 Accepts]: Start accepts. Operand has 60 places, 52 transitions, 364 flow [2022-12-13 00:47:38,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:38,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:38,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 52 transitions, 364 flow [2022-12-13 00:47:38,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 364 flow [2022-12-13 00:47:38,562 INFO L130 PetriNetUnfolder]: 128/377 cut-off events. [2022-12-13 00:47:38,563 INFO L131 PetriNetUnfolder]: For 321/511 co-relation queries the response was YES. [2022-12-13 00:47:38,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 377 events. 128/377 cut-off events. For 321/511 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2198 event pairs, 2 based on Foata normal form. 2/192 useless extension candidates. Maximal degree in co-relation 1407. Up to 235 conditions per place. [2022-12-13 00:47:38,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 52 transitions, 364 flow [2022-12-13 00:47:38,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-13 00:47:41,857 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:47:41,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3339 [2022-12-13 00:47:41,858 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 364 flow [2022-12-13 00:47:41,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:41,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:41,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:41,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:47:41,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:47:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1470152817, now seen corresponding path program 1 times [2022-12-13 00:47:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010694214] [2022-12-13 00:47:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:47:41,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:47:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:47:41,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:47:41,955 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:47:41,956 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:47:41,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:47:41,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:47:41,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:47:41,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:47:41,957 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:41,961 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:47:41,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:47:42,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:47:42 BasicIcfg [2022-12-13 00:47:42,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:47:42,045 INFO L158 Benchmark]: Toolchain (without parser) took 17448.10ms. Allocated memory was 178.3MB in the beginning and 680.5MB in the end (delta: 502.3MB). Free memory was 151.3MB in the beginning and 512.4MB in the end (delta: -361.0MB). Peak memory consumption was 142.1MB. Max. memory is 8.0GB. [2022-12-13 00:47:42,045 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory was 105.1MB in the beginning and 105.0MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:47:42,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.58ms. Allocated memory is still 178.3MB. Free memory was 151.0MB in the beginning and 152.6MB in the end (delta: -1.6MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2022-12-13 00:47:42,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.96ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 150.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:47:42,046 INFO L158 Benchmark]: Boogie Preprocessor took 26.41ms. Allocated memory is still 178.3MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:47:42,046 INFO L158 Benchmark]: RCFGBuilder took 708.36ms. Allocated memory is still 178.3MB. Free memory was 147.9MB in the beginning and 133.0MB in the end (delta: 14.8MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2022-12-13 00:47:42,046 INFO L158 Benchmark]: TraceAbstraction took 16141.49ms. Allocated memory was 178.3MB in the beginning and 680.5MB in the end (delta: 502.3MB). Free memory was 132.0MB in the beginning and 512.4MB in the end (delta: -380.4MB). Peak memory consumption was 122.4MB. Max. memory is 8.0GB. [2022-12-13 00:47:42,047 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.13ms. Allocated memory is still 127.9MB. Free memory was 105.1MB in the beginning and 105.0MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 507.58ms. Allocated memory is still 178.3MB. Free memory was 151.0MB in the beginning and 152.6MB in the end (delta: -1.6MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.96ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 150.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.41ms. Allocated memory is still 178.3MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 708.36ms. Allocated memory is still 178.3MB. Free memory was 147.9MB in the beginning and 133.0MB in the end (delta: 14.8MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16141.49ms. Allocated memory was 178.3MB in the beginning and 680.5MB in the end (delta: 502.3MB). Free memory was 132.0MB in the beginning and 512.4MB in the end (delta: -380.4MB). Peak memory consumption was 122.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 119 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 29 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1162, independent: 1095, independent conditional: 1095, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1162, independent: 1095, independent conditional: 0, independent unconditional: 1095, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1162, independent: 1095, independent conditional: 0, independent unconditional: 1095, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1162, independent: 1095, independent conditional: 0, independent unconditional: 1095, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 879, independent: 836, independent conditional: 0, independent unconditional: 836, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 879, independent: 797, independent conditional: 0, independent unconditional: 797, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1162, independent: 259, independent conditional: 0, independent unconditional: 259, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 879, unknown conditional: 0, unknown unconditional: 879] , Statistics on independence cache: Total cache size (in pairs): 1301, Positive cache size: 1258, Positive conditional cache size: 0, Positive unconditional cache size: 1258, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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.2s, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 149, independent conditional: 149, 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: 179, independent: 149, independent conditional: 0, independent unconditional: 149, 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: 179, independent: 149, independent conditional: 0, independent unconditional: 149, 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: 179, independent: 149, independent conditional: 0, independent unconditional: 149, 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: 153, independent: 131, independent conditional: 0, independent unconditional: 131, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 153, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 153, unknown conditional: 0, unknown unconditional: 153] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 339, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 339, independent: 286, independent conditional: 22, independent unconditional: 264, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 339, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 339, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 21, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 339, independent: 267, independent conditional: 0, independent unconditional: 267, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139, independent: 114, independent conditional: 7, independent unconditional: 107, dependent: 25, dependent conditional: 11, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 93, independent conditional: 93, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 113, independent: 93, independent conditional: 21, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113, independent: 93, independent conditional: 21, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 93, independent conditional: 21, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 2, independent unconditional: 11, 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: 15, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 36, independent conditional: 34, independent unconditional: 3, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, independent: 80, independent conditional: 19, independent unconditional: 61, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 15, unknown conditional: 2, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 177, Positive conditional cache size: 2, Positive unconditional cache size: 175, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 128, independent conditional: 20, independent unconditional: 108, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 128, independent conditional: 20, independent unconditional: 108, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 128, independent conditional: 20, independent unconditional: 108, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 93, dependent conditional: 70, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 112, independent conditional: 20, independent unconditional: 92, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 20, unknown conditional: 2, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 193, Positive conditional cache size: 2, Positive unconditional cache size: 191, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 40, independent conditional: 11, independent unconditional: 29, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 40, independent conditional: 11, independent unconditional: 29, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 40, independent conditional: 11, independent unconditional: 29, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 59, independent: 40, independent conditional: 11, independent unconditional: 29, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 193, Positive conditional cache size: 2, Positive unconditional cache size: 191, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, 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, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 201, Positive conditional cache size: 2, Positive unconditional cache size: 199, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, 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: 33, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 201, Positive conditional cache size: 2, Positive unconditional cache size: 199, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, 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: 3.3s, 56 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 352, independent: 330, independent conditional: 330, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 352, independent: 330, independent conditional: 256, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 352, independent: 330, independent conditional: 256, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 352, independent: 330, independent conditional: 256, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 10, 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: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 352, independent: 313, independent conditional: 246, independent unconditional: 67, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 19, unknown conditional: 10, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 253, Positive conditional cache size: 12, Positive unconditional cache size: 241, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1749, ((void *)0), P0, ((void *)0))=-3, t1749={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t1750; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1750, ((void *)0), P1, ((void *)0))=-2, t1749={7:0}, t1750={8:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] 2 y = 1 [L796] 2 __unbuffered_p1_EAX = y [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L853] 0 pthread_t t1751; [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1751, ((void *)0), P2, ((void *)0))=-1, t1749={7:0}, t1750={8:0}, t1751={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L824] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 852]: 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: 854]: 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 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: 16.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 2 mSDtfsCounter, 693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:47:42,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...