/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:25:55,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:25:55,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:25:55,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:25:55,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:25:55,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:25:55,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:25:55,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:25:55,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:25:55,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:25:55,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:25:55,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:25:55,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:25:55,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:25:55,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:25:55,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:25:55,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:25:55,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:25:55,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:25:55,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:25:55,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:25:55,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:25:55,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:25:55,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:25:55,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:25:55,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:25:55,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:25:55,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:25:55,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:25:55,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:25:55,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:25:55,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:25:55,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:25:55,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:25:55,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:25:55,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:25:55,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:25:55,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:25:55,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:25:55,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:25:55,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:25:55,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:25:55,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:25:55,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:25:55,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:25:55,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:25:55,550 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:25:55,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:25:55,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:25:55,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:25:55,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:25:55,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:25:55,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:25:55,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:25:55,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:25:55,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:25:55,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:25:55,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:25:55,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:25:55,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:25:55,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:25:55,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:25:55,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:25:55,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:25:55,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:25:55,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:25:55,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:25:55,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:25:55,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:25:55,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:25:55,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:25:55,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:25:55,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:25:55,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:25:55,890 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:25:55,891 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:25:55,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-06 06:25:57,043 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:25:57,391 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:25:57,392 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-06 06:25:57,422 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7cebfd06/b99131d5a4814e1e82568396f137811e/FLAGc04742899 [2022-12-06 06:25:57,438 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7cebfd06/b99131d5a4814e1e82568396f137811e [2022-12-06 06:25:57,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:25:57,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:25:57,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:25:57,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:25:57,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:25:57,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:57,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b040a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57, skipping insertion in model container [2022-12-06 06:25:57,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:57,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:25:57,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:25:57,682 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/mix038_tso.oepc.i[949,962] [2022-12-06 06:25:57,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:25:57,868 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:25:57,884 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/mix038_tso.oepc.i[949,962] [2022-12-06 06:25:57,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:57,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:57,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:25:57,983 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:25:57,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57 WrapperNode [2022-12-06 06:25:57,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:25:57,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:25:57,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:25:57,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:25:57,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,034 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-06 06:25:58,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:25:58,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:25:58,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:25:58,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:25:58,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,064 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:25:58,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:25:58,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:25:58,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:25:58,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (1/1) ... [2022-12-06 06:25:58,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:25:58,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:25:58,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:25:58,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:25:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:25:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:25:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:25:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:25:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:25:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:25:58,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:25:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:25:58,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:25:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:25:58,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:25:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:25:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:25:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:25:58,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:25:58,165 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:25:58,333 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:25:58,335 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:25:58,646 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:25:58,842 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:25:58,842 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:25:58,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:58 BoogieIcfgContainer [2022-12-06 06:25:58,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:25:58,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:25:58,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:25:58,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:25:58,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:25:57" (1/3) ... [2022-12-06 06:25:58,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4431202a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:25:58, skipping insertion in model container [2022-12-06 06:25:58,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:57" (2/3) ... [2022-12-06 06:25:58,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4431202a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:25:58, skipping insertion in model container [2022-12-06 06:25:58,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:58" (3/3) ... [2022-12-06 06:25:58,901 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-12-06 06:25:58,918 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:25:58,918 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:25:58,919 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:25:59,006 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:25:59,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-06 06:25:59,115 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-06 06:25:59,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:59,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 06:25:59,122 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-06 06:25:59,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-06 06:25:59,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:59,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-06 06:25:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-06 06:25:59,198 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-06 06:25:59,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:59,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 06:25:59,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-06 06:25:59,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-06 06:26:04,597 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-06 06:26:04,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:26:04,617 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;@3184481e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:26:04,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:26:04,620 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:26:04,620 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:26:04,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:04,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:26:04,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 465488276, now seen corresponding path program 1 times [2022-12-06 06:26:04,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:04,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486767626] [2022-12-06 06:26:04,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:04,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486767626] [2022-12-06 06:26:04,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486767626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:04,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:04,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:26:04,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445610566] [2022-12-06 06:26:04,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:05,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:26:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:05,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:26:05,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:26:05,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:26:05,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:05,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:05,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:26:05,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:05,442 INFO L130 PetriNetUnfolder]: 1103/1790 cut-off events. [2022-12-06 06:26:05,443 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:26:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 1790 events. 1103/1790 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9621 event pairs, 182 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 3466. Up to 1318 conditions per place. [2022-12-06 06:26:05,464 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 29 selfloop transitions, 2 changer transitions 6/40 dead transitions. [2022-12-06 06:26:05,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 166 flow [2022-12-06 06:26:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:26:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:26:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 06:26:05,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:26:05,478 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 51 transitions. [2022-12-06 06:26:05,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 166 flow [2022-12-06 06:26:05,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:26:05,484 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2022-12-06 06:26:05,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-06 06:26:05,491 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 06:26:05,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:05,492 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 54 flow [2022-12-06 06:26:05,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:05,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:05,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 54 flow [2022-12-06 06:26:05,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-06 06:26:05,501 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:26:05,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:26:05,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:26:05,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-06 06:26:05,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:26:05,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:26:05,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 06:26:05,634 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:26:05,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:05,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:05,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:05,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:26:05,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:05,635 INFO L85 PathProgramCache]: Analyzing trace with hash 659741765, now seen corresponding path program 1 times [2022-12-06 06:26:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:05,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328961087] [2022-12-06 06:26:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:05,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:06,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328961087] [2022-12-06 06:26:06,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328961087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:06,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:06,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:26:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315200082] [2022-12-06 06:26:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:06,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:06,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:26:06,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:06,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:06,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:26:06,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:06,312 INFO L130 PetriNetUnfolder]: 1099/1635 cut-off events. [2022-12-06 06:26:06,313 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-06 06:26:06,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 1635 events. 1099/1635 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6522 event pairs, 259 based on Foata normal form. 25/1660 useless extension candidates. Maximal degree in co-relation 3431. Up to 1316 conditions per place. [2022-12-06 06:26:06,324 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 06:26:06,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 136 flow [2022-12-06 06:26:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:26:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:26:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 06:26:06,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2022-12-06 06:26:06,326 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 32 transitions. [2022-12-06 06:26:06,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 136 flow [2022-12-06 06:26:06,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:26:06,329 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 06:26:06,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 06:26:06,330 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2022-12-06 06:26:06,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:06,330 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:26:06,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:06,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:06,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:26:06,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:26:06,338 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:26:06,339 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:26:06,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:26:06,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:26:06,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 06:26:06,384 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:06,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 06:26:06,386 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 06:26:06,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:06,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:06,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:06,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:26:06,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1022840730, now seen corresponding path program 1 times [2022-12-06 06:26:06,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:06,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119337697] [2022-12-06 06:26:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:06,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119337697] [2022-12-06 06:26:06,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119337697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:06,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:06,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:26:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870413758] [2022-12-06 06:26:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:06,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:06,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:26:06,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:06,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:06,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:26:06,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:07,105 INFO L130 PetriNetUnfolder]: 670/1063 cut-off events. [2022-12-06 06:26:07,105 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2022-12-06 06:26:07,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 1063 events. 670/1063 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4640 event pairs, 288 based on Foata normal form. 2/1061 useless extension candidates. Maximal degree in co-relation 2306. Up to 986 conditions per place. [2022-12-06 06:26:07,112 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 26 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2022-12-06 06:26:07,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 145 flow [2022-12-06 06:26:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:26:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:26:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:26:07,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-06 06:26:07,114 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:26:07,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 145 flow [2022-12-06 06:26:07,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:26:07,116 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 78 flow [2022-12-06 06:26:07,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-06 06:26:07,117 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2022-12-06 06:26:07,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:07,117 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 78 flow [2022-12-06 06:26:07,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:07,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:07,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 78 flow [2022-12-06 06:26:07,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 78 flow [2022-12-06 06:26:07,127 INFO L130 PetriNetUnfolder]: 14/56 cut-off events. [2022-12-06 06:26:07,127 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:26:07,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 56 events. 14/56 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 event pairs, 6 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 97. Up to 29 conditions per place. [2022-12-06 06:26:07,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 78 flow [2022-12-06 06:26:07,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:26:07,137 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:07,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:26:07,138 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 78 flow [2022-12-06 06:26:07,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:07,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:07,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:07,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:26:07,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1640466268, now seen corresponding path program 1 times [2022-12-06 06:26:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:07,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891544880] [2022-12-06 06:26:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:07,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891544880] [2022-12-06 06:26:07,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891544880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:07,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:07,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844155322] [2022-12-06 06:26:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:07,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:26:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:07,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:26:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:26:07,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:26:07,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:07,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:07,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:26:07,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:07,869 INFO L130 PetriNetUnfolder]: 680/1091 cut-off events. [2022-12-06 06:26:07,869 INFO L131 PetriNetUnfolder]: For 258/277 co-relation queries the response was YES. [2022-12-06 06:26:07,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1091 events. 680/1091 cut-off events. For 258/277 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4796 event pairs, 280 based on Foata normal form. 20/1109 useless extension candidates. Maximal degree in co-relation 2595. Up to 902 conditions per place. [2022-12-06 06:26:07,881 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 35 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-12-06 06:26:07,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 222 flow [2022-12-06 06:26:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:26:07,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:26:07,885 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 78 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:26:07,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 222 flow [2022-12-06 06:26:07,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:07,887 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 130 flow [2022-12-06 06:26:07,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 06:26:07,888 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-06 06:26:07,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:07,888 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 130 flow [2022-12-06 06:26:07,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:07,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:07,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 130 flow [2022-12-06 06:26:07,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 130 flow [2022-12-06 06:26:07,899 INFO L130 PetriNetUnfolder]: 22/69 cut-off events. [2022-12-06 06:26:07,899 INFO L131 PetriNetUnfolder]: For 63/77 co-relation queries the response was YES. [2022-12-06 06:26:07,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 69 events. 22/69 cut-off events. For 63/77 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 232 event pairs, 10 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 176. Up to 36 conditions per place. [2022-12-06 06:26:07,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 130 flow [2022-12-06 06:26:07,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 06:26:07,909 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:07,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:26:07,911 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 130 flow [2022-12-06 06:26:07,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:07,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:07,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:07,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:26:07,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash -299175094, now seen corresponding path program 1 times [2022-12-06 06:26:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:07,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433883704] [2022-12-06 06:26:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:08,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433883704] [2022-12-06 06:26:08,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433883704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:08,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:08,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:26:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252779509] [2022-12-06 06:26:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:08,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:08,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:08,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:26:08,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:08,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:08,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:26:08,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:08,315 INFO L130 PetriNetUnfolder]: 697/1131 cut-off events. [2022-12-06 06:26:08,315 INFO L131 PetriNetUnfolder]: For 906/954 co-relation queries the response was YES. [2022-12-06 06:26:08,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 1131 events. 697/1131 cut-off events. For 906/954 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5051 event pairs, 144 based on Foata normal form. 23/1150 useless extension candidates. Maximal degree in co-relation 3159. Up to 852 conditions per place. [2022-12-06 06:26:08,329 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 39 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2022-12-06 06:26:08,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 300 flow [2022-12-06 06:26:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:26:08,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:26:08,333 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 130 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:26:08,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 300 flow [2022-12-06 06:26:08,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 296 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 06:26:08,338 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 176 flow [2022-12-06 06:26:08,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-06 06:26:08,340 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 06:26:08,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:08,340 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 176 flow [2022-12-06 06:26:08,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:08,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:08,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 176 flow [2022-12-06 06:26:08,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 176 flow [2022-12-06 06:26:08,370 INFO L130 PetriNetUnfolder]: 58/146 cut-off events. [2022-12-06 06:26:08,370 INFO L131 PetriNetUnfolder]: For 196/219 co-relation queries the response was YES. [2022-12-06 06:26:08,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 146 events. 58/146 cut-off events. For 196/219 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 630 event pairs, 24 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 432. Up to 66 conditions per place. [2022-12-06 06:26:08,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 176 flow [2022-12-06 06:26:08,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 06:26:08,376 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:08,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 06:26:08,378 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 176 flow [2022-12-06 06:26:08,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:08,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:08,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:26:08,379 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash -303103414, now seen corresponding path program 2 times [2022-12-06 06:26:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:08,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688924167] [2022-12-06 06:26:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:08,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688924167] [2022-12-06 06:26:08,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688924167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:08,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:08,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041851981] [2022-12-06 06:26:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:08,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:26:08,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:08,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:26:08,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:26:08,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:26:08,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:08,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:08,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:26:08,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:09,021 INFO L130 PetriNetUnfolder]: 697/1131 cut-off events. [2022-12-06 06:26:09,021 INFO L131 PetriNetUnfolder]: For 1579/1638 co-relation queries the response was YES. [2022-12-06 06:26:09,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1131 events. 697/1131 cut-off events. For 1579/1638 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5093 event pairs, 143 based on Foata normal form. 29/1156 useless extension candidates. Maximal degree in co-relation 3557. Up to 853 conditions per place. [2022-12-06 06:26:09,031 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2022-12-06 06:26:09,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 364 flow [2022-12-06 06:26:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:26:09,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:26:09,036 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 176 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:26:09,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 364 flow [2022-12-06 06:26:09,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 350 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:09,042 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 220 flow [2022-12-06 06:26:09,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-06 06:26:09,044 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2022-12-06 06:26:09,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:09,044 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 220 flow [2022-12-06 06:26:09,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:09,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:09,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 220 flow [2022-12-06 06:26:09,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 220 flow [2022-12-06 06:26:09,068 INFO L130 PetriNetUnfolder]: 59/147 cut-off events. [2022-12-06 06:26:09,068 INFO L131 PetriNetUnfolder]: For 332/368 co-relation queries the response was YES. [2022-12-06 06:26:09,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 147 events. 59/147 cut-off events. For 332/368 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 621 event pairs, 24 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 488. Up to 67 conditions per place. [2022-12-06 06:26:09,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 220 flow [2022-12-06 06:26:09,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 06:26:09,074 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:09,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 06:26:09,075 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 220 flow [2022-12-06 06:26:09,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:09,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:09,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:09,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:26:09,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2068918970, now seen corresponding path program 1 times [2022-12-06 06:26:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43788013] [2022-12-06 06:26:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:09,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:09,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43788013] [2022-12-06 06:26:09,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43788013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:09,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:09,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:09,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099261559] [2022-12-06 06:26:09,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:09,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:26:09,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:09,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:26:09,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:26:09,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:26:09,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:09,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:09,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:26:09,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:09,869 INFO L130 PetriNetUnfolder]: 741/1208 cut-off events. [2022-12-06 06:26:09,869 INFO L131 PetriNetUnfolder]: For 2609/2679 co-relation queries the response was YES. [2022-12-06 06:26:09,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3934 conditions, 1208 events. 741/1208 cut-off events. For 2609/2679 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5650 event pairs, 128 based on Foata normal form. 49/1253 useless extension candidates. Maximal degree in co-relation 3914. Up to 738 conditions per place. [2022-12-06 06:26:09,882 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 45 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2022-12-06 06:26:09,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 441 flow [2022-12-06 06:26:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:26:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:26:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 06:26:09,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 06:26:09,884 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 220 flow. Second operand 5 states and 65 transitions. [2022-12-06 06:26:09,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 441 flow [2022-12-06 06:26:09,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 427 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:09,891 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 290 flow [2022-12-06 06:26:09,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-12-06 06:26:09,894 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2022-12-06 06:26:09,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:09,894 INFO L89 Accepts]: Start accepts. Operand has 48 places, 39 transitions, 290 flow [2022-12-06 06:26:09,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:09,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:09,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 290 flow [2022-12-06 06:26:09,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 290 flow [2022-12-06 06:26:09,922 INFO L130 PetriNetUnfolder]: 61/157 cut-off events. [2022-12-06 06:26:09,922 INFO L131 PetriNetUnfolder]: For 521/624 co-relation queries the response was YES. [2022-12-06 06:26:09,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 157 events. 61/157 cut-off events. For 521/624 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 708 event pairs, 14 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 592. Up to 69 conditions per place. [2022-12-06 06:26:09,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 290 flow [2022-12-06 06:26:09,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 06:26:09,929 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:09,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:26:09,931 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 290 flow [2022-12-06 06:26:09,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:09,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:09,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:09,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:26:09,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -235175773, now seen corresponding path program 1 times [2022-12-06 06:26:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:09,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233523065] [2022-12-06 06:26:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:10,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:10,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233523065] [2022-12-06 06:26:10,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233523065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:10,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:10,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:10,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316713261] [2022-12-06 06:26:10,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:10,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:10,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:26:10,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:10,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:10,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:26:10,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:10,420 INFO L130 PetriNetUnfolder]: 1210/1979 cut-off events. [2022-12-06 06:26:10,421 INFO L131 PetriNetUnfolder]: For 6804/6842 co-relation queries the response was YES. [2022-12-06 06:26:10,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 1979 events. 1210/1979 cut-off events. For 6804/6842 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10324 event pairs, 219 based on Foata normal form. 79/2050 useless extension candidates. Maximal degree in co-relation 6783. Up to 908 conditions per place. [2022-12-06 06:26:10,440 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 61 selfloop transitions, 2 changer transitions 3/71 dead transitions. [2022-12-06 06:26:10,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 628 flow [2022-12-06 06:26:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:26:10,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:26:10,442 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 290 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:26:10,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 628 flow [2022-12-06 06:26:10,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 560 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-06 06:26:10,450 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 265 flow [2022-12-06 06:26:10,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-06 06:26:10,452 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2022-12-06 06:26:10,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:10,452 INFO L89 Accepts]: Start accepts. Operand has 50 places, 40 transitions, 265 flow [2022-12-06 06:26:10,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:10,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:10,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 265 flow [2022-12-06 06:26:10,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 265 flow [2022-12-06 06:26:10,484 INFO L130 PetriNetUnfolder]: 89/247 cut-off events. [2022-12-06 06:26:10,484 INFO L131 PetriNetUnfolder]: For 637/707 co-relation queries the response was YES. [2022-12-06 06:26:10,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 247 events. 89/247 cut-off events. For 637/707 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1336 event pairs, 19 based on Foata normal form. 4/240 useless extension candidates. Maximal degree in co-relation 789. Up to 109 conditions per place. [2022-12-06 06:26:10,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 265 flow [2022-12-06 06:26:10,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 06:26:10,495 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:10,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 06:26:10,497 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 265 flow [2022-12-06 06:26:10,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:10,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:10,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:10,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:26:10,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:10,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1074002789, now seen corresponding path program 2 times [2022-12-06 06:26:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:10,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233501455] [2022-12-06 06:26:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:10,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:10,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233501455] [2022-12-06 06:26:10,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233501455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:10,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:10,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:26:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384014659] [2022-12-06 06:26:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:10,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:26:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:26:10,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:26:10,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:26:10,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:10,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:10,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:26:10,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:10,836 INFO L130 PetriNetUnfolder]: 567/1011 cut-off events. [2022-12-06 06:26:10,836 INFO L131 PetriNetUnfolder]: For 2730/2774 co-relation queries the response was YES. [2022-12-06 06:26:10,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 1011 events. 567/1011 cut-off events. For 2730/2774 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5135 event pairs, 116 based on Foata normal form. 79/1077 useless extension candidates. Maximal degree in co-relation 3489. Up to 785 conditions per place. [2022-12-06 06:26:10,844 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 46 selfloop transitions, 4 changer transitions 2/59 dead transitions. [2022-12-06 06:26:10,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 477 flow [2022-12-06 06:26:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:26:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:26:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 06:26:10,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2022-12-06 06:26:10,845 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 265 flow. Second operand 3 states and 41 transitions. [2022-12-06 06:26:10,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 477 flow [2022-12-06 06:26:10,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:26:10,850 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 274 flow [2022-12-06 06:26:10,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-06 06:26:10,851 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2022-12-06 06:26:10,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:10,851 INFO L89 Accepts]: Start accepts. Operand has 52 places, 41 transitions, 274 flow [2022-12-06 06:26:10,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:10,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:10,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 274 flow [2022-12-06 06:26:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 274 flow [2022-12-06 06:26:10,897 INFO L130 PetriNetUnfolder]: 145/376 cut-off events. [2022-12-06 06:26:10,897 INFO L131 PetriNetUnfolder]: For 814/880 co-relation queries the response was YES. [2022-12-06 06:26:10,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 376 events. 145/376 cut-off events. For 814/880 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2268 event pairs, 45 based on Foata normal form. 6/352 useless extension candidates. Maximal degree in co-relation 1179. Up to 146 conditions per place. [2022-12-06 06:26:10,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 274 flow [2022-12-06 06:26:10,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 06:26:11,087 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:26:11,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 06:26:11,088 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 276 flow [2022-12-06 06:26:11,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:11,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:11,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:11,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:26:11,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:11,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1842259221, now seen corresponding path program 1 times [2022-12-06 06:26:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:11,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637085727] [2022-12-06 06:26:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:11,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637085727] [2022-12-06 06:26:11,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637085727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:11,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:11,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342891655] [2022-12-06 06:26:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:11,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:11,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 06:26:11,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:11,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:11,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 06:26:11,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:11,390 INFO L130 PetriNetUnfolder]: 279/555 cut-off events. [2022-12-06 06:26:11,390 INFO L131 PetriNetUnfolder]: For 1412/1447 co-relation queries the response was YES. [2022-12-06 06:26:11,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2155 conditions, 555 events. 279/555 cut-off events. For 1412/1447 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2632 event pairs, 60 based on Foata normal form. 77/623 useless extension candidates. Maximal degree in co-relation 2129. Up to 184 conditions per place. [2022-12-06 06:26:11,395 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 51 selfloop transitions, 7 changer transitions 3/68 dead transitions. [2022-12-06 06:26:11,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 557 flow [2022-12-06 06:26:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 06:26:11,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-06 06:26:11,396 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 276 flow. Second operand 4 states and 56 transitions. [2022-12-06 06:26:11,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 557 flow [2022-12-06 06:26:11,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 513 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:26:11,400 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 274 flow [2022-12-06 06:26:11,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-12-06 06:26:11,403 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2022-12-06 06:26:11,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:11,404 INFO L89 Accepts]: Start accepts. Operand has 52 places, 42 transitions, 274 flow [2022-12-06 06:26:11,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:11,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:11,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 274 flow [2022-12-06 06:26:11,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 274 flow [2022-12-06 06:26:11,430 INFO L130 PetriNetUnfolder]: 63/199 cut-off events. [2022-12-06 06:26:11,431 INFO L131 PetriNetUnfolder]: For 324/407 co-relation queries the response was YES. [2022-12-06 06:26:11,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 199 events. 63/199 cut-off events. For 324/407 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 949 event pairs, 7 based on Foata normal form. 11/201 useless extension candidates. Maximal degree in co-relation 648. Up to 79 conditions per place. [2022-12-06 06:26:11,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 274 flow [2022-12-06 06:26:11,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 06:26:11,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:26:11,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 06:26:11,435 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 274 flow [2022-12-06 06:26:11,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:11,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:11,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:11,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:26:11,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:11,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 821613818, now seen corresponding path program 1 times [2022-12-06 06:26:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:11,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753876856] [2022-12-06 06:26:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:11,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753876856] [2022-12-06 06:26:11,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753876856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:11,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:11,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:26:11,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705311396] [2022-12-06 06:26:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:11,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:26:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:11,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:26:11,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:26:11,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 06:26:11,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06 06:26:11,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:11,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 06:26:11,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:11,755 INFO L130 PetriNetUnfolder]: 239/467 cut-off events. [2022-12-06 06:26:11,755 INFO L131 PetriNetUnfolder]: For 1123/1157 co-relation queries the response was YES. [2022-12-06 06:26:11,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 467 events. 239/467 cut-off events. For 1123/1157 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2172 event pairs, 55 based on Foata normal form. 30/490 useless extension candidates. Maximal degree in co-relation 1793. Up to 184 conditions per place. [2022-12-06 06:26:11,759 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 41 selfloop transitions, 10 changer transitions 11/68 dead transitions. [2022-12-06 06:26:11,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 541 flow [2022-12-06 06:26:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:26:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:26:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 06:26:11,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2022-12-06 06:26:11,761 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 274 flow. Second operand 5 states and 58 transitions. [2022-12-06 06:26:11,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 541 flow [2022-12-06 06:26:11,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 491 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 06:26:11,765 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 232 flow [2022-12-06 06:26:11,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2022-12-06 06:26:11,766 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2022-12-06 06:26:11,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:11,766 INFO L89 Accepts]: Start accepts. Operand has 53 places, 38 transitions, 232 flow [2022-12-06 06:26:11,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:11,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:11,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 232 flow [2022-12-06 06:26:11,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 232 flow [2022-12-06 06:26:11,781 INFO L130 PetriNetUnfolder]: 41/130 cut-off events. [2022-12-06 06:26:11,781 INFO L131 PetriNetUnfolder]: For 212/239 co-relation queries the response was YES. [2022-12-06 06:26:11,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 130 events. 41/130 cut-off events. For 212/239 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 543 event pairs, 1 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 403. Up to 38 conditions per place. [2022-12-06 06:26:11,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 232 flow [2022-12-06 06:26:11,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 06:26:36,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L748-->L751: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [430] $Ultimate##0-->L777: Formula: (and (= v_~x$w_buff0_used~0_240 v_~x$w_buff1_used~0_203) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_203 256) 0)) (not (= (mod v_~x$w_buff0_used~0_239 256) 0)))) 1 0)) (= 2 v_~x$w_buff0~0_143) (= v_~x$r_buff0_thd2~0_78 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd2~0_61 v_~x$r_buff0_thd2~0_79) (= v_~x$r_buff0_thd0~0_117 v_~x$r_buff1_thd0~0_114) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$w_buff0~0_144 v_~x$w_buff1~0_129) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$w_buff0_used~0_239 1) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd3~0_49 v_~x$r_buff0_thd3~0_43)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_144, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_79, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_143, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_129, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_114, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_239, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:26:36,490 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:26:36,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24725 [2022-12-06 06:26:36,491 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 232 flow [2022-12-06 06:26:36,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06 06:26:36,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:36,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:36,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:26:36,492 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:36,493 INFO L85 PathProgramCache]: Analyzing trace with hash -875111941, now seen corresponding path program 1 times [2022-12-06 06:26:36,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:36,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287191529] [2022-12-06 06:26:36,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:36,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:36,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287191529] [2022-12-06 06:26:36,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287191529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:26:36,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:26:36,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:26:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429496612] [2022-12-06 06:26:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:26:36,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:26:36,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:26:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:26:36,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:26:36,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:36,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:36,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:26:36,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:36,819 INFO L130 PetriNetUnfolder]: 371/695 cut-off events. [2022-12-06 06:26:36,819 INFO L131 PetriNetUnfolder]: For 1779/1786 co-relation queries the response was YES. [2022-12-06 06:26:36,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2744 conditions, 695 events. 371/695 cut-off events. For 1779/1786 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3491 event pairs, 61 based on Foata normal form. 3/693 useless extension candidates. Maximal degree in co-relation 2719. Up to 378 conditions per place. [2022-12-06 06:26:36,825 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 35 selfloop transitions, 1 changer transitions 32/71 dead transitions. [2022-12-06 06:26:36,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 616 flow [2022-12-06 06:26:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:26:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:26:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:26:36,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:26:36,827 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 232 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:26:36,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 616 flow [2022-12-06 06:26:36,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 528 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-06 06:26:36,832 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 169 flow [2022-12-06 06:26:36,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2022-12-06 06:26:36,833 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2022-12-06 06:26:36,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:36,833 INFO L89 Accepts]: Start accepts. Operand has 50 places, 31 transitions, 169 flow [2022-12-06 06:26:36,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:36,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:36,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 31 transitions, 169 flow [2022-12-06 06:26:36,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 31 transitions, 169 flow [2022-12-06 06:26:36,845 INFO L130 PetriNetUnfolder]: 23/85 cut-off events. [2022-12-06 06:26:36,845 INFO L131 PetriNetUnfolder]: For 84/87 co-relation queries the response was YES. [2022-12-06 06:26:36,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 85 events. 23/85 cut-off events. For 84/87 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 287 event pairs, 1 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 239. Up to 26 conditions per place. [2022-12-06 06:26:36,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 31 transitions, 169 flow [2022-12-06 06:26:36,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 06:26:37,137 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:26:37,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 06:26:37,138 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 172 flow [2022-12-06 06:26:37,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:37,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:37,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:37,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:26:37,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:26:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2078330398, now seen corresponding path program 1 times [2022-12-06 06:26:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:37,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571939012] [2022-12-06 06:26:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:37,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:26:37,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:26:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:26:37,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:26:37,237 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:26:37,238 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:26:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:26:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:26:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:26:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:26:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:26:37,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:26:37,241 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:37,246 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:26:37,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:26:37,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:26:37 BasicIcfg [2022-12-06 06:26:37,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:26:37,328 INFO L158 Benchmark]: Toolchain (without parser) took 39885.13ms. Allocated memory was 179.3MB in the beginning and 729.8MB in the end (delta: 550.5MB). Free memory was 154.6MB in the beginning and 348.4MB in the end (delta: -193.8MB). Peak memory consumption was 357.5MB. Max. memory is 8.0GB. [2022-12-06 06:26:37,329 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:26:37,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.83ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 127.6MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:26:37,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 179.3MB. Free memory was 127.6MB in the beginning and 124.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:26:37,329 INFO L158 Benchmark]: Boogie Preprocessor took 36.53ms. Allocated memory is still 179.3MB. Free memory was 124.9MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:26:37,329 INFO L158 Benchmark]: RCFGBuilder took 779.71ms. Allocated memory is still 179.3MB. Free memory was 122.8MB in the beginning and 87.7MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 06:26:37,330 INFO L158 Benchmark]: TraceAbstraction took 38466.03ms. Allocated memory was 179.3MB in the beginning and 729.8MB in the end (delta: 550.5MB). Free memory was 87.2MB in the beginning and 348.4MB in the end (delta: -261.2MB). Peak memory consumption was 290.4MB. Max. memory is 8.0GB. [2022-12-06 06:26:37,331 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 539.83ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 127.6MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 179.3MB. Free memory was 127.6MB in the beginning and 124.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.53ms. Allocated memory is still 179.3MB. Free memory was 124.9MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 779.71ms. Allocated memory is still 179.3MB. Free memory was 122.8MB in the beginning and 87.7MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 38466.03ms. Allocated memory was 179.3MB in the beginning and 729.8MB in the end (delta: 550.5MB). Free memory was 87.2MB in the beginning and 348.4MB in the end (delta: -261.2MB). Peak memory consumption was 290.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 117 PlacesBefore, 37 PlacesAfterwards, 109 TransitionsBefore, 28 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 1700, independent unconditional: 0, dependent: 96, dependent conditional: 96, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1796, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1415, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1415, independent: 1332, independent conditional: 0, independent unconditional: 1332, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 282, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1796, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 1415, unknown conditional: 0, unknown unconditional: 1415] , Statistics on independence cache: Total cache size (in pairs): 2133, Positive cache size: 2089, Positive conditional cache size: 0, Positive unconditional cache size: 2089, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, independent: 179, independent conditional: 179, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 224, independent: 179, independent conditional: 20, independent unconditional: 159, dependent: 45, dependent conditional: 6, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 179, independent conditional: 20, independent unconditional: 159, dependent: 45, dependent conditional: 6, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 179, independent conditional: 20, independent unconditional: 159, dependent: 45, dependent conditional: 6, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 89, independent conditional: 10, independent unconditional: 79, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 92, dependent conditional: 10, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 90, independent conditional: 10, independent unconditional: 80, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 110, unknown conditional: 12, unknown unconditional: 98] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 91, Positive conditional cache size: 10, Positive unconditional cache size: 81, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, 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, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 82, independent conditional: 82, 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: 102, independent: 82, independent conditional: 3, independent unconditional: 79, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 102, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 29, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 113, Positive conditional cache size: 10, Positive unconditional cache size: 103, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 71, independent conditional: 4, independent unconditional: 67, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 71, independent conditional: 3, independent unconditional: 68, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 71, independent conditional: 3, independent unconditional: 68, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 69, independent conditional: 2, independent unconditional: 67, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 115, Positive conditional cache size: 11, Positive unconditional cache size: 104, Negative cache size: 30, Negative conditional cache size: 4, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 118, independent conditional: 118, 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: 138, independent: 118, independent conditional: 20, independent unconditional: 98, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 118, independent conditional: 15, independent unconditional: 103, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 118, independent conditional: 15, independent unconditional: 103, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, independent: 116, independent conditional: 15, independent unconditional: 101, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 117, Positive conditional cache size: 11, Positive unconditional cache size: 106, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 63, independent conditional: 15, independent unconditional: 48, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 63, independent conditional: 13, independent unconditional: 50, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 63, independent conditional: 13, independent unconditional: 50, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 77, independent: 62, independent conditional: 13, independent unconditional: 49, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 118, Positive conditional cache size: 11, Positive unconditional cache size: 107, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 97, independent conditional: 97, 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: 116, independent: 97, independent conditional: 21, independent unconditional: 76, 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: 116, independent: 97, independent conditional: 15, independent unconditional: 82, 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: 116, independent: 97, independent conditional: 15, independent unconditional: 82, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 93, independent conditional: 15, independent unconditional: 78, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 122, Positive conditional cache size: 11, Positive unconditional cache size: 111, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, independent: 117, independent conditional: 117, 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: 139, independent: 117, independent conditional: 35, independent unconditional: 82, 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: 139, independent: 117, independent conditional: 31, independent unconditional: 86, 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: 139, independent: 117, independent conditional: 31, independent unconditional: 86, 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: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 114, independent conditional: 29, independent unconditional: 85, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 125, Positive conditional cache size: 13, Positive unconditional cache size: 112, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 119, independent conditional: 48, independent unconditional: 71, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 119, independent conditional: 44, independent unconditional: 75, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 119, independent conditional: 44, independent unconditional: 75, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 114, independent conditional: 40, independent unconditional: 74, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 130, Positive conditional cache size: 17, Positive unconditional cache size: 113, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 157, independent conditional: 157, 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: 179, independent: 157, independent conditional: 35, independent unconditional: 122, 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: 179, independent: 157, independent conditional: 33, independent unconditional: 124, 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: 179, independent: 157, independent conditional: 33, independent unconditional: 124, 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: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 151, independent conditional: 32, independent unconditional: 119, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 143, Positive conditional cache size: 18, Positive unconditional cache size: 125, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 62, independent conditional: 26, independent unconditional: 36, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 62, independent conditional: 26, independent unconditional: 36, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 62, independent conditional: 26, independent unconditional: 36, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 72, independent: 62, independent conditional: 26, independent unconditional: 36, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 143, Positive conditional cache size: 18, Positive unconditional cache size: 125, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, 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: 24.7s, 53 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 68, independent conditional: 26, independent unconditional: 42, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 68, independent conditional: 14, independent unconditional: 54, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 68, independent conditional: 14, independent unconditional: 54, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 83, independent: 67, independent conditional: 14, independent unconditional: 53, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 170, Positive conditional cache size: 18, Positive unconditional cache size: 152, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 48 PlacesBefore, 46 PlacesAfterwards, 31 TransitionsBefore, 29 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 35, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 57, independent conditional: 33, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 33, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 9, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 57, independent: 44, independent conditional: 24, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 9, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 226, Positive conditional cache size: 33, Positive unconditional cache size: 193, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-1, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L834] 0 pthread_t t1021; [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 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) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 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) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 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 [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 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 [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 831]: 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: 833]: 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: 835]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 714 IncrementalHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 10 mSDtfsCounter, 714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=7, InterpolantAutomatonStates: 46, 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, 3.2s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:26:37,372 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...