/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:55:35,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:55:35,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:55:35,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:55:35,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:55:35,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:55:35,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:55:35,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:55:35,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:55:35,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:55:35,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:55:35,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:55:35,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:55:35,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:55:35,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:55:35,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:55:35,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:55:35,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:55:35,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:55:35,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:55:35,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:55:35,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:55:35,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:55:35,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:55:35,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:55:35,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:55:35,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:55:35,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:55:35,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:55:35,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:55:35,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:55:35,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:55:35,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:55:35,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:55:35,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:55:35,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:55:35,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:55:35,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:55:35,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:55:35,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:55:35,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:55:35,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:55:35,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:55:35,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:55:35,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:55:35,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:55:35,637 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:55:35,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:55:35,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:55:35,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:55:35,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:55:35,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:55:35,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:55:35,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:55:35,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:55:35,640 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:55:35,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:55:35,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:55:35,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:55:35,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:55:35,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:55:35,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:55:35,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:55:35,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:55:35,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:55:35,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:55:35,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:55:35,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:55:35,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:55:35,642 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:55:35,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:55:35,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:55:35,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:55:35,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:55:35,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:55:35,999 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:55:36,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:55:37,153 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:55:37,425 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:55:37,426 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:55:37,440 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbea689d6/d84108095c8e4655a12a82415a92ddb8/FLAG9469ef0de [2022-12-05 22:55:37,459 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbea689d6/d84108095c8e4655a12a82415a92ddb8 [2022-12-05 22:55:37,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:55:37,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:55:37,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:55:37,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:55:37,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:55:37,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:55:37" (1/1) ... [2022-12-05 22:55:37,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4237ff4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:37, skipping insertion in model container [2022-12-05 22:55:37,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:55:37" (1/1) ... [2022-12-05 22:55:37,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:55:37,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:55:37,667 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 22:55:37,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:55:37,914 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:55:37,926 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/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 22:55:37,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:37,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:37,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:38,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:38,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:38,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:38,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:38,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:55:38,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:55:38,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:55:38,045 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:55:38,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38 WrapperNode [2022-12-05 22:55:38,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:55:38,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:55:38,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:55:38,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:55:38,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,108 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-05 22:55:38,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:55:38,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:55:38,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:55:38,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:55:38,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,159 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:55:38,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:55:38,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:55:38,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:55:38,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (1/1) ... [2022-12-05 22:55:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:55:38,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:55:38,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 22:55:38,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 22:55:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:55:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:55:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:55:38,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:55:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:55:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:55:38,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:55:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:55:38,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:55:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:55:38,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:55:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 22:55:38,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 22:55:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:55:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:55:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:55:38,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:55:38,250 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:55:38,434 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:55:38,435 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:55:38,748 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:55:38,989 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:55:38,989 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:55:38,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:55:38 BoogieIcfgContainer [2022-12-05 22:55:38,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:55:38,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:55:38,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:55:38,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:55:38,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:55:37" (1/3) ... [2022-12-05 22:55:38,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161e5bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:55:38, skipping insertion in model container [2022-12-05 22:55:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:55:38" (2/3) ... [2022-12-05 22:55:38,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161e5bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:55:38, skipping insertion in model container [2022-12-05 22:55:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:55:38" (3/3) ... [2022-12-05 22:55:38,999 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 22:55:39,015 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:55:39,016 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:55:39,016 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:55:39,092 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:55:39,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-05 22:55:39,233 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-05 22:55:39,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:55:39,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-05 22:55:39,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-05 22:55:39,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-05 22:55:39,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:39,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-05 22:55:39,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-05 22:55:39,319 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-05 22:55:39,320 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:55:39,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-05 22:55:39,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-05 22:55:39,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-05 22:55:44,420 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-05 22:55:44,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:55:44,439 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;@45255f84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:55:44,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 22:55:44,441 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 22:55:44,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:55:44,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:44,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 22:55:44,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash 545536, now seen corresponding path program 1 times [2022-12-05 22:55:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:44,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600067464] [2022-12-05 22:55:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:44,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:44,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600067464] [2022-12-05 22:55:44,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600067464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:44,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:44,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:55:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422817170] [2022-12-05 22:55:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:44,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:55:44,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:55:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:55:44,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-05 22:55:44,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:44,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:44,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-05 22:55:44,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:45,914 INFO L130 PetriNetUnfolder]: 6050/8806 cut-off events. [2022-12-05 22:55:45,914 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 22:55:45,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17205 conditions, 8806 events. 6050/8806 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 52879 event pairs, 1106 based on Foata normal form. 0/8049 useless extension candidates. Maximal degree in co-relation 17193. Up to 6574 conditions per place. [2022-12-05 22:55:45,957 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-05 22:55:45,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-05 22:55:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:55:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:55:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-05 22:55:45,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-05 22:55:45,967 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-05 22:55:45,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-05 22:55:45,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 22:55:45,972 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-05 22:55:45,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-05 22:55:45,976 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-05 22:55:45,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:45,977 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-05 22:55:45,979 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:45,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:45,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-05 22:55:45,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-05 22:55:45,985 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-05 22:55:45,985 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:55:45,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:55:45,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-05 22:55:45,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-05 22:55:46,078 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:55:46,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-05 22:55:46,080 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-05 22:55:46,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:46,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:46,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:46,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:55:46,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1368413395, now seen corresponding path program 1 times [2022-12-05 22:55:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:46,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502574961] [2022-12-05 22:55:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:46,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502574961] [2022-12-05 22:55:46,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502574961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:46,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:46,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:55:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449751497] [2022-12-05 22:55:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:46,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:55:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:55:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:55:46,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 22:55:46,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:46,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:46,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 22:55:46,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:48,361 INFO L130 PetriNetUnfolder]: 14433/19638 cut-off events. [2022-12-05 22:55:48,361 INFO L131 PetriNetUnfolder]: For 657/657 co-relation queries the response was YES. [2022-12-05 22:55:48,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40412 conditions, 19638 events. 14433/19638 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 102413 event pairs, 5265 based on Foata normal form. 458/20096 useless extension candidates. Maximal degree in co-relation 40402. Up to 13647 conditions per place. [2022-12-05 22:55:48,483 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2022-12-05 22:55:48,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2022-12-05 22:55:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:55:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:55:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-05 22:55:48,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-05 22:55:48,486 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 52 transitions. [2022-12-05 22:55:48,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2022-12-05 22:55:48,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:55:48,488 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2022-12-05 22:55:48,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-05 22:55:48,489 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-05 22:55:48,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:48,489 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 118 flow [2022-12-05 22:55:48,490 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:48,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:48,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-05 22:55:48,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 118 flow [2022-12-05 22:55:48,534 INFO L130 PetriNetUnfolder]: 152/414 cut-off events. [2022-12-05 22:55:48,534 INFO L131 PetriNetUnfolder]: For 40/51 co-relation queries the response was YES. [2022-12-05 22:55:48,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 414 events. 152/414 cut-off events. For 40/51 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2485 event pairs, 78 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 773. Up to 221 conditions per place. [2022-12-05 22:55:48,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-05 22:55:48,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-05 22:55:48,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:55:48,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-05 22:55:48,601 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2022-12-05 22:55:48,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:48,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:48,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:48,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:55:48,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 528856213, now seen corresponding path program 1 times [2022-12-05 22:55:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:48,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063087269] [2022-12-05 22:55:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:48,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063087269] [2022-12-05 22:55:48,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063087269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:48,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:48,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:55:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327765366] [2022-12-05 22:55:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:48,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:55:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:55:48,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:55:48,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 22:55:48,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:48,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:48,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 22:55:48,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:50,573 INFO L130 PetriNetUnfolder]: 13351/18188 cut-off events. [2022-12-05 22:55:50,573 INFO L131 PetriNetUnfolder]: For 6397/6397 co-relation queries the response was YES. [2022-12-05 22:55:50,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 18188 events. 13351/18188 cut-off events. For 6397/6397 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 90129 event pairs, 3910 based on Foata normal form. 230/18418 useless extension candidates. Maximal degree in co-relation 44445. Up to 9003 conditions per place. [2022-12-05 22:55:50,673 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-05 22:55:50,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2022-12-05 22:55:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:55:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:55:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-05 22:55:50,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-05 22:55:50,676 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 58 transitions. [2022-12-05 22:55:50,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2022-12-05 22:55:50,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:55:50,716 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 162 flow [2022-12-05 22:55:50,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-05 22:55:50,717 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-05 22:55:50,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:50,717 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 162 flow [2022-12-05 22:55:50,720 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:50,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:50,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 162 flow [2022-12-05 22:55:50,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 162 flow [2022-12-05 22:55:50,748 INFO L130 PetriNetUnfolder]: 122/335 cut-off events. [2022-12-05 22:55:50,749 INFO L131 PetriNetUnfolder]: For 143/169 co-relation queries the response was YES. [2022-12-05 22:55:50,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 335 events. 122/335 cut-off events. For 143/169 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1820 event pairs, 46 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 749. Up to 181 conditions per place. [2022-12-05 22:55:50,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 162 flow [2022-12-05 22:55:50,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-05 22:55:50,784 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:55:50,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-05 22:55:50,785 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 162 flow [2022-12-05 22:55:50,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:50,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:50,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:50,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:55:50,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -785935931, now seen corresponding path program 1 times [2022-12-05 22:55:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835610478] [2022-12-05 22:55:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:50,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835610478] [2022-12-05 22:55:50,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835610478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:50,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:50,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:55:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520066971] [2022-12-05 22:55:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:50,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:55:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:55:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:55:50,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 22:55:50,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 162 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:50,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:50,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 22:55:50,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:52,639 INFO L130 PetriNetUnfolder]: 13076/17813 cut-off events. [2022-12-05 22:55:52,639 INFO L131 PetriNetUnfolder]: For 11093/11093 co-relation queries the response was YES. [2022-12-05 22:55:52,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46098 conditions, 17813 events. 13076/17813 cut-off events. For 11093/11093 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 91421 event pairs, 3313 based on Foata normal form. 40/17853 useless extension candidates. Maximal degree in co-relation 46083. Up to 11817 conditions per place. [2022-12-05 22:55:52,752 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 62 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2022-12-05 22:55:52,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 444 flow [2022-12-05 22:55:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:55:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:55:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-05 22:55:52,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-05 22:55:52,755 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 162 flow. Second operand 4 states and 70 transitions. [2022-12-05 22:55:52,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 444 flow [2022-12-05 22:55:52,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:55:52,787 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 255 flow [2022-12-05 22:55:52,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-05 22:55:52,789 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-05 22:55:52,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:52,789 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 255 flow [2022-12-05 22:55:52,790 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:52,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:52,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 255 flow [2022-12-05 22:55:52,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 255 flow [2022-12-05 22:55:52,817 INFO L130 PetriNetUnfolder]: 106/303 cut-off events. [2022-12-05 22:55:52,818 INFO L131 PetriNetUnfolder]: For 313/368 co-relation queries the response was YES. [2022-12-05 22:55:52,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 303 events. 106/303 cut-off events. For 313/368 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1634 event pairs, 44 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 830. Up to 161 conditions per place. [2022-12-05 22:55:52,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 255 flow [2022-12-05 22:55:52,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-05 22:55:52,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:55:52,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-05 22:55:52,831 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 255 flow [2022-12-05 22:55:52,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:52,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:52,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:52,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:55:52,831 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:52,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1405832123, now seen corresponding path program 1 times [2022-12-05 22:55:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:52,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381578262] [2022-12-05 22:55:52,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:53,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381578262] [2022-12-05 22:55:53,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381578262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:53,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:53,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:55:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649731684] [2022-12-05 22:55:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:53,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:55:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:53,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:55:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:55:53,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 22:55:53,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:53,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:53,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 22:55:53,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:53,863 INFO L130 PetriNetUnfolder]: 6225/9219 cut-off events. [2022-12-05 22:55:53,863 INFO L131 PetriNetUnfolder]: For 6771/7175 co-relation queries the response was YES. [2022-12-05 22:55:53,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23574 conditions, 9219 events. 6225/9219 cut-off events. For 6771/7175 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 53609 event pairs, 1470 based on Foata normal form. 416/9373 useless extension candidates. Maximal degree in co-relation 23556. Up to 7593 conditions per place. [2022-12-05 22:55:53,926 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 47 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-05 22:55:53,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 447 flow [2022-12-05 22:55:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:55:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:55:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-05 22:55:53,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 22:55:53,928 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 255 flow. Second operand 3 states and 56 transitions. [2022-12-05 22:55:53,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 447 flow [2022-12-05 22:55:53,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:55:53,942 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 288 flow [2022-12-05 22:55:53,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-05 22:55:53,943 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-05 22:55:53,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:53,943 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 288 flow [2022-12-05 22:55:53,944 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:53,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:53,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 288 flow [2022-12-05 22:55:53,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 288 flow [2022-12-05 22:55:54,018 INFO L130 PetriNetUnfolder]: 429/991 cut-off events. [2022-12-05 22:55:54,018 INFO L131 PetriNetUnfolder]: For 537/616 co-relation queries the response was YES. [2022-12-05 22:55:54,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 991 events. 429/991 cut-off events. For 537/616 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7120 event pairs, 206 based on Foata normal form. 4/909 useless extension candidates. Maximal degree in co-relation 2321. Up to 533 conditions per place. [2022-12-05 22:55:54,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 288 flow [2022-12-05 22:55:54,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-05 22:55:54,041 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:55:54,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-05 22:55:54,042 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 288 flow [2022-12-05 22:55:54,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:54,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:54,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:54,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:55:54,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2102710013, now seen corresponding path program 1 times [2022-12-05 22:55:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:54,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655798498] [2022-12-05 22:55:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:54,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:54,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655798498] [2022-12-05 22:55:54,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655798498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:54,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:54,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:55:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310372339] [2022-12-05 22:55:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:54,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:55:54,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:55:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:55:54,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 22:55:54,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:54,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:54,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 22:55:54,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:54,713 INFO L130 PetriNetUnfolder]: 3385/5292 cut-off events. [2022-12-05 22:55:54,713 INFO L131 PetriNetUnfolder]: For 4233/4465 co-relation queries the response was YES. [2022-12-05 22:55:54,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15789 conditions, 5292 events. 3385/5292 cut-off events. For 4233/4465 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 30488 event pairs, 811 based on Foata normal form. 462/5596 useless extension candidates. Maximal degree in co-relation 15768. Up to 2189 conditions per place. [2022-12-05 22:55:54,744 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 64 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2022-12-05 22:55:54,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 604 flow [2022-12-05 22:55:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:55:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:55:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-05 22:55:54,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-05 22:55:54,745 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 288 flow. Second operand 4 states and 77 transitions. [2022-12-05 22:55:54,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 604 flow [2022-12-05 22:55:54,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:55:54,756 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 335 flow [2022-12-05 22:55:54,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-05 22:55:54,757 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-05 22:55:54,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:54,757 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 335 flow [2022-12-05 22:55:54,758 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:54,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:54,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 335 flow [2022-12-05 22:55:54,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 335 flow [2022-12-05 22:55:54,809 INFO L130 PetriNetUnfolder]: 248/655 cut-off events. [2022-12-05 22:55:54,809 INFO L131 PetriNetUnfolder]: For 541/696 co-relation queries the response was YES. [2022-12-05 22:55:54,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 655 events. 248/655 cut-off events. For 541/696 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4303 event pairs, 66 based on Foata normal form. 32/649 useless extension candidates. Maximal degree in co-relation 1957. Up to 348 conditions per place. [2022-12-05 22:55:54,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 335 flow [2022-12-05 22:55:54,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-05 22:55:54,821 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:55:54,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-05 22:55:54,822 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 335 flow [2022-12-05 22:55:54,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:54,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:54,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:54,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:55:54,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:54,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash -247803220, now seen corresponding path program 1 times [2022-12-05 22:55:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:54,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970441119] [2022-12-05 22:55:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:54,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:55,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970441119] [2022-12-05 22:55:55,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970441119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:55,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:55,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:55:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531009869] [2022-12-05 22:55:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:55,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:55:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:55,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:55:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:55:55,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 22:55:55,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:55,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:55,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 22:55:55,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:55,504 INFO L130 PetriNetUnfolder]: 2611/4059 cut-off events. [2022-12-05 22:55:55,504 INFO L131 PetriNetUnfolder]: For 5490/5703 co-relation queries the response was YES. [2022-12-05 22:55:55,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13297 conditions, 4059 events. 2611/4059 cut-off events. For 5490/5703 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22825 event pairs, 702 based on Foata normal form. 230/4145 useless extension candidates. Maximal degree in co-relation 13274. Up to 1579 conditions per place. [2022-12-05 22:55:55,529 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 77 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2022-12-05 22:55:55,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 745 flow [2022-12-05 22:55:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:55:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:55:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-05 22:55:55,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-05 22:55:55,531 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 335 flow. Second operand 5 states and 96 transitions. [2022-12-05 22:55:55,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 745 flow [2022-12-05 22:55:55,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 727 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 22:55:55,544 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 385 flow [2022-12-05 22:55:55,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2022-12-05 22:55:55,545 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-05 22:55:55,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:55,545 INFO L89 Accepts]: Start accepts. Operand has 58 places, 56 transitions, 385 flow [2022-12-05 22:55:55,546 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:55,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:55,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 385 flow [2022-12-05 22:55:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 385 flow [2022-12-05 22:55:55,582 INFO L130 PetriNetUnfolder]: 162/430 cut-off events. [2022-12-05 22:55:55,582 INFO L131 PetriNetUnfolder]: For 649/796 co-relation queries the response was YES. [2022-12-05 22:55:55,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 430 events. 162/430 cut-off events. For 649/796 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2440 event pairs, 23 based on Foata normal form. 33/437 useless extension candidates. Maximal degree in co-relation 1444. Up to 185 conditions per place. [2022-12-05 22:55:55,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 385 flow [2022-12-05 22:55:55,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 848 [2022-12-05 22:55:55,610 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:55:55,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 22:55:55,611 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 385 flow [2022-12-05 22:55:55,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:55,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:55,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:55:55,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1399722530, now seen corresponding path program 1 times [2022-12-05 22:55:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:55,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108772032] [2022-12-05 22:55:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:56,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:56,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108772032] [2022-12-05 22:55:56,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108772032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:56,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:56,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:55:56,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694880510] [2022-12-05 22:55:56,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:56,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:55:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:55:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:55:56,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-05 22:55:56,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 385 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:56,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:56,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-05 22:55:56,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:57,045 INFO L130 PetriNetUnfolder]: 3724/5970 cut-off events. [2022-12-05 22:55:57,045 INFO L131 PetriNetUnfolder]: For 10745/10888 co-relation queries the response was YES. [2022-12-05 22:55:57,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20851 conditions, 5970 events. 3724/5970 cut-off events. For 10745/10888 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 36596 event pairs, 534 based on Foata normal form. 75/5927 useless extension candidates. Maximal degree in co-relation 20827. Up to 2014 conditions per place. [2022-12-05 22:55:57,073 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 97 selfloop transitions, 7 changer transitions 48/167 dead transitions. [2022-12-05 22:55:57,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 167 transitions, 1377 flow [2022-12-05 22:55:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:55:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:55:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-12-05 22:55:57,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2022-12-05 22:55:57,074 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 385 flow. Second operand 7 states and 114 transitions. [2022-12-05 22:55:57,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 167 transitions, 1377 flow [2022-12-05 22:55:57,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 167 transitions, 1223 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-05 22:55:57,170 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 394 flow [2022-12-05 22:55:57,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2022-12-05 22:55:57,172 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-05 22:55:57,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:57,172 INFO L89 Accepts]: Start accepts. Operand has 64 places, 61 transitions, 394 flow [2022-12-05 22:55:57,174 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:57,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:57,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 61 transitions, 394 flow [2022-12-05 22:55:57,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 61 transitions, 394 flow [2022-12-05 22:55:57,222 INFO L130 PetriNetUnfolder]: 321/809 cut-off events. [2022-12-05 22:55:57,222 INFO L131 PetriNetUnfolder]: For 999/1147 co-relation queries the response was YES. [2022-12-05 22:55:57,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 809 events. 321/809 cut-off events. For 999/1147 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5389 event pairs, 31 based on Foata normal form. 60/817 useless extension candidates. Maximal degree in co-relation 2505. Up to 278 conditions per place. [2022-12-05 22:55:57,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 61 transitions, 394 flow [2022-12-05 22:55:57,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-05 22:55:57,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:55:57,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-05 22:55:57,393 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 400 flow [2022-12-05 22:55:57,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:57,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:57,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:57,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:55:57,394 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1157399058, now seen corresponding path program 2 times [2022-12-05 22:55:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:57,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209519283] [2022-12-05 22:55:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:57,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209519283] [2022-12-05 22:55:57,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209519283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:57,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:57,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:55:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441901821] [2022-12-05 22:55:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:57,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:55:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:57,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:55:57,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:55:57,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-05 22:55:57,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:57,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:57,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-05 22:55:57,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:58,132 INFO L130 PetriNetUnfolder]: 3150/4951 cut-off events. [2022-12-05 22:55:58,133 INFO L131 PetriNetUnfolder]: For 7960/8247 co-relation queries the response was YES. [2022-12-05 22:55:58,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17495 conditions, 4951 events. 3150/4951 cut-off events. For 7960/8247 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29953 event pairs, 700 based on Foata normal form. 144/4926 useless extension candidates. Maximal degree in co-relation 17473. Up to 1989 conditions per place. [2022-12-05 22:55:58,174 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 82 selfloop transitions, 17 changer transitions 2/116 dead transitions. [2022-12-05 22:55:58,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 116 transitions, 869 flow [2022-12-05 22:55:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:55:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:55:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-05 22:55:58,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5804597701149425 [2022-12-05 22:55:58,176 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 400 flow. Second operand 6 states and 101 transitions. [2022-12-05 22:55:58,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 116 transitions, 869 flow [2022-12-05 22:55:58,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 116 transitions, 858 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-05 22:55:58,289 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 422 flow [2022-12-05 22:55:58,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2022-12-05 22:55:58,290 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-05 22:55:58,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:58,290 INFO L89 Accepts]: Start accepts. Operand has 65 places, 60 transitions, 422 flow [2022-12-05 22:55:58,292 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:58,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:58,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 60 transitions, 422 flow [2022-12-05 22:55:58,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 422 flow [2022-12-05 22:55:58,332 INFO L130 PetriNetUnfolder]: 281/686 cut-off events. [2022-12-05 22:55:58,332 INFO L131 PetriNetUnfolder]: For 1134/1242 co-relation queries the response was YES. [2022-12-05 22:55:58,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 686 events. 281/686 cut-off events. For 1134/1242 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4475 event pairs, 23 based on Foata normal form. 1/634 useless extension candidates. Maximal degree in co-relation 2483. Up to 221 conditions per place. [2022-12-05 22:55:58,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 60 transitions, 422 flow [2022-12-05 22:55:58,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 848 [2022-12-05 22:55:58,940 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:55:58,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 651 [2022-12-05 22:55:58,941 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 428 flow [2022-12-05 22:55:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:58,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:58,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:58,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:55:58,942 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash 358470185, now seen corresponding path program 1 times [2022-12-05 22:55:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:58,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332069456] [2022-12-05 22:55:58,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:59,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:59,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332069456] [2022-12-05 22:55:59,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332069456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:59,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:59,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:55:59,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503611225] [2022-12-05 22:55:59,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:59,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:55:59,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:59,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:55:59,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:55:59,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 22:55:59,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 428 flow. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:59,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:59,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 22:55:59,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:00,136 INFO L130 PetriNetUnfolder]: 6298/9440 cut-off events. [2022-12-05 22:56:00,136 INFO L131 PetriNetUnfolder]: For 25458/25458 co-relation queries the response was YES. [2022-12-05 22:56:00,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38517 conditions, 9440 events. 6298/9440 cut-off events. For 25458/25458 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 53388 event pairs, 835 based on Foata normal form. 2/9442 useless extension candidates. Maximal degree in co-relation 38490. Up to 2913 conditions per place. [2022-12-05 22:56:00,180 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 98 selfloop transitions, 20 changer transitions 53/171 dead transitions. [2022-12-05 22:56:00,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 171 transitions, 1545 flow [2022-12-05 22:56:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:56:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:56:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-05 22:56:00,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2022-12-05 22:56:00,182 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 428 flow. Second operand 6 states and 88 transitions. [2022-12-05 22:56:00,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 171 transitions, 1545 flow [2022-12-05 22:56:00,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 171 transitions, 1369 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-12-05 22:56:00,380 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 455 flow [2022-12-05 22:56:00,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2022-12-05 22:56:00,380 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2022-12-05 22:56:00,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:00,381 INFO L89 Accepts]: Start accepts. Operand has 66 places, 61 transitions, 455 flow [2022-12-05 22:56:00,382 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:00,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:00,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 61 transitions, 455 flow [2022-12-05 22:56:00,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 61 transitions, 455 flow [2022-12-05 22:56:00,432 INFO L130 PetriNetUnfolder]: 276/684 cut-off events. [2022-12-05 22:56:00,432 INFO L131 PetriNetUnfolder]: For 1643/1808 co-relation queries the response was YES. [2022-12-05 22:56:00,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 684 events. 276/684 cut-off events. For 1643/1808 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4620 event pairs, 15 based on Foata normal form. 39/650 useless extension candidates. Maximal degree in co-relation 2220. Up to 211 conditions per place. [2022-12-05 22:56:00,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 61 transitions, 455 flow [2022-12-05 22:56:00,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-05 22:56:00,466 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:00,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-05 22:56:00,467 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 455 flow [2022-12-05 22:56:00,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:00,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:00,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:00,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:56:00,468 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2119407972, now seen corresponding path program 1 times [2022-12-05 22:56:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:00,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323749772] [2022-12-05 22:56:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:56:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:00,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323749772] [2022-12-05 22:56:00,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323749772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:00,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:00,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:56:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359982121] [2022-12-05 22:56:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:00,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:56:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:56:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:56:00,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 22:56:00,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 455 flow. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:00,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:00,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 22:56:00,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:01,698 INFO L130 PetriNetUnfolder]: 6101/9291 cut-off events. [2022-12-05 22:56:01,698 INFO L131 PetriNetUnfolder]: For 24042/24042 co-relation queries the response was YES. [2022-12-05 22:56:01,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35787 conditions, 9291 events. 6101/9291 cut-off events. For 24042/24042 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 54774 event pairs, 894 based on Foata normal form. 2/9293 useless extension candidates. Maximal degree in co-relation 35758. Up to 3462 conditions per place. [2022-12-05 22:56:01,744 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 76 selfloop transitions, 13 changer transitions 85/174 dead transitions. [2022-12-05 22:56:01,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 174 transitions, 1489 flow [2022-12-05 22:56:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:56:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:56:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-05 22:56:01,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-05 22:56:01,745 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 455 flow. Second operand 6 states and 96 transitions. [2022-12-05 22:56:01,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 174 transitions, 1489 flow [2022-12-05 22:56:01,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 174 transitions, 1467 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-05 22:56:01,909 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 380 flow [2022-12-05 22:56:01,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2022-12-05 22:56:01,910 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2022-12-05 22:56:01,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:01,910 INFO L89 Accepts]: Start accepts. Operand has 71 places, 53 transitions, 380 flow [2022-12-05 22:56:01,911 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:01,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:01,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 53 transitions, 380 flow [2022-12-05 22:56:01,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 53 transitions, 380 flow [2022-12-05 22:56:01,954 INFO L130 PetriNetUnfolder]: 192/535 cut-off events. [2022-12-05 22:56:01,955 INFO L131 PetriNetUnfolder]: For 1567/1750 co-relation queries the response was YES. [2022-12-05 22:56:01,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 535 events. 192/535 cut-off events. For 1567/1750 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3565 event pairs, 7 based on Foata normal form. 38/526 useless extension candidates. Maximal degree in co-relation 1750. Up to 163 conditions per place. [2022-12-05 22:56:01,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 53 transitions, 380 flow [2022-12-05 22:56:01,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-05 22:56:01,962 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:56:01,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-05 22:56:01,963 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 380 flow [2022-12-05 22:56:01,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:01,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:01,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:01,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:56:01,964 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1157686334, now seen corresponding path program 2 times [2022-12-05 22:56:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:01,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076513312] [2022-12-05 22:56:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:56:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:02,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076513312] [2022-12-05 22:56:02,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076513312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:02,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:02,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:56:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393527726] [2022-12-05 22:56:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:02,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:56:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:56:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:56:02,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 22:56:02,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:02,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:02,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 22:56:02,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:02,662 INFO L130 PetriNetUnfolder]: 3191/5325 cut-off events. [2022-12-05 22:56:02,663 INFO L131 PetriNetUnfolder]: For 13785/13876 co-relation queries the response was YES. [2022-12-05 22:56:02,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19785 conditions, 5325 events. 3191/5325 cut-off events. For 13785/13876 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 33317 event pairs, 1315 based on Foata normal form. 6/5256 useless extension candidates. Maximal degree in co-relation 19757. Up to 3119 conditions per place. [2022-12-05 22:56:02,680 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 43 selfloop transitions, 2 changer transitions 37/85 dead transitions. [2022-12-05 22:56:02,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 675 flow [2022-12-05 22:56:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:56:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:56:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-05 22:56:02,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2022-12-05 22:56:02,682 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 380 flow. Second operand 3 states and 52 transitions. [2022-12-05 22:56:02,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 675 flow [2022-12-05 22:56:02,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 634 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-05 22:56:02,762 INFO L231 Difference]: Finished difference. Result has 67 places, 40 transitions, 220 flow [2022-12-05 22:56:02,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2022-12-05 22:56:02,763 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-05 22:56:02,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:02,763 INFO L89 Accepts]: Start accepts. Operand has 67 places, 40 transitions, 220 flow [2022-12-05 22:56:02,764 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:02,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:02,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 40 transitions, 220 flow [2022-12-05 22:56:02,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 40 transitions, 220 flow [2022-12-05 22:56:02,774 INFO L130 PetriNetUnfolder]: 46/139 cut-off events. [2022-12-05 22:56:02,774 INFO L131 PetriNetUnfolder]: For 303/348 co-relation queries the response was YES. [2022-12-05 22:56:02,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 139 events. 46/139 cut-off events. For 303/348 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 540 event pairs, 4 based on Foata normal form. 10/139 useless extension candidates. Maximal degree in co-relation 388. Up to 44 conditions per place. [2022-12-05 22:56:02,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 40 transitions, 220 flow [2022-12-05 22:56:02,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-05 22:56:02,991 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:56:02,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-05 22:56:02,992 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 214 flow [2022-12-05 22:56:02,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:56:02,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:02,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:02,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:56:02,992 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash -796083652, now seen corresponding path program 1 times [2022-12-05 22:56:02,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:02,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540573281] [2022-12-05 22:56:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:56:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:56:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:56:03,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540573281] [2022-12-05 22:56:03,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540573281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:56:03,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:56:03,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:56:03,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608506586] [2022-12-05 22:56:03,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:56:03,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:56:03,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:56:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:56:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:56:03,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 22:56:03,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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-05 22:56:03,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:56:03,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 22:56:03,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:56:03,958 INFO L130 PetriNetUnfolder]: 644/1072 cut-off events. [2022-12-05 22:56:03,958 INFO L131 PetriNetUnfolder]: For 2026/2032 co-relation queries the response was YES. [2022-12-05 22:56:03,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3914 conditions, 1072 events. 644/1072 cut-off events. For 2026/2032 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4863 event pairs, 99 based on Foata normal form. 1/1069 useless extension candidates. Maximal degree in co-relation 3886. Up to 690 conditions per place. [2022-12-05 22:56:03,963 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 48 selfloop transitions, 5 changer transitions 28/82 dead transitions. [2022-12-05 22:56:03,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 597 flow [2022-12-05 22:56:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:56:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:56:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-05 22:56:03,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-05 22:56:03,965 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 214 flow. Second operand 6 states and 57 transitions. [2022-12-05 22:56:03,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 597 flow [2022-12-05 22:56:03,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 572 flow, removed 1 selfloop flow, removed 8 redundant places. [2022-12-05 22:56:03,974 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 211 flow [2022-12-05 22:56:03,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2022-12-05 22:56:03,975 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2022-12-05 22:56:03,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:56:03,975 INFO L89 Accepts]: Start accepts. Operand has 59 places, 37 transitions, 211 flow [2022-12-05 22:56:03,977 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:56:03,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:56:03,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 37 transitions, 211 flow [2022-12-05 22:56:03,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 37 transitions, 211 flow [2022-12-05 22:56:03,990 INFO L130 PetriNetUnfolder]: 46/132 cut-off events. [2022-12-05 22:56:03,990 INFO L131 PetriNetUnfolder]: For 243/273 co-relation queries the response was YES. [2022-12-05 22:56:03,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 132 events. 46/132 cut-off events. For 243/273 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 526 event pairs, 2 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 387. Up to 44 conditions per place. [2022-12-05 22:56:03,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 37 transitions, 211 flow [2022-12-05 22:56:03,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-05 22:56:04,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [530] L873-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_183 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_177 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_542 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_543 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_463 256) 0))))) (and (= v_~main$tmp_guard1~0_64 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_74 0) (= 0 v_~__unbuffered_p3_EBX~0_90) (= v_~x~0_94 2) (= v_~__unbuffered_p1_EAX~0_74 0) (= v_~__unbuffered_p3_EAX~0_70 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_67| (mod v_~main$tmp_guard1~0_64 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_221 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_74) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= v_~a$w_buff0_used~0_542 (ite .cse0 0 v_~a$w_buff0_used~0_543)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_463) v_~a$w_buff1_used~0_462) (= (ite .cse2 0 v_~a$r_buff0_thd0~0_177) v_~a$r_buff0_thd0~0_176) (= (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd0~0_176 256) 0))) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_462 256) 0)))) 0 v_~a$r_buff1_thd0~0_183) v_~a$r_buff1_thd0~0_182) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_67| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (= v_~a~0_397 (ite .cse0 v_~a$w_buff0~0_302 (ite .cse1 v_~a$w_buff1~0_250 v_~a~0_398))) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_49| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|)))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_543, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_90, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_177, ~a~0=v_~a~0_398, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_250, ~a$w_buff0~0=v_~a$w_buff0~0_302, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_183, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_74, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_221, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_463, ~x~0=v_~x~0_94} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_79|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_542, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_90, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_176, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_67|, ~a~0=v_~a~0_397, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_67|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_250, ~a$w_buff0~0=v_~a$w_buff0~0_302, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_49|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_74, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_221, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_462, ~x~0=v_~x~0_94, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [533] $Ultimate##0-->L766: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.base_73| |v_P0Thread1of1ForFork0_#in~arg#1.base_73|) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_73| |v_P0Thread1of1ForFork0_~arg#1.offset_73|) (= v_~a$w_buff0_used~0_594 1) (= v_~a$w_buff0~0_326 1) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_77| 0)) (= v_~a$r_buff0_thd0~0_184 v_~a$r_buff1_thd0~0_190) (= v_~a$r_buff0_thd2~0_176 v_~a$r_buff1_thd2~0_176) (= v_~a$r_buff0_thd1~0_221 1) (= v_~x~0_98 1) (= v_~a$r_buff0_thd4~0_231 v_~a$r_buff1_thd4~0_236) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_594 256) 0)) (not (= (mod v_~a$w_buff1_used~0_510 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_77| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|) (= v_~a$r_buff0_thd1~0_222 v_~a$r_buff1_thd1~0_135) (= v_~a$w_buff0_used~0_595 v_~a$w_buff1_used~0_510) (= v_~a$r_buff0_thd3~0_189 v_~a$r_buff1_thd3~0_194) (= v_~a$w_buff0~0_327 v_~a$w_buff1~0_269)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_73|, ~a$w_buff0~0=v_~a$w_buff0~0_327, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_176, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_189, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_595, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_73|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_222, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_184, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_231} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_73|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_236, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_135, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_194, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_176, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_176, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_73|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_189, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_594, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_73|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_221, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_184, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_73|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_231, ~a$w_buff1~0=v_~a$w_buff1~0_269, ~a$w_buff0~0=v_~a$w_buff0~0_326, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_190, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_510, ~x~0=v_~x~0_98, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_77|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] [2022-12-05 22:56:04,409 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:56:04,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 435 [2022-12-05 22:56:04,410 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 232 flow [2022-12-05 22:56:04,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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-05 22:56:04,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:56:04,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:04,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 22:56:04,411 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:56:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:56:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash -605312010, now seen corresponding path program 2 times [2022-12-05 22:56:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:56:04,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605572292] [2022-12-05 22:56:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:56:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:56:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:56:04,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:56:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:56:04,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:56:04,553 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:56:04,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 22:56:04,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 22:56:04,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 22:56:04,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 22:56:04,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 22:56:04,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 22:56:04,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 22:56:04,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 22:56:04,559 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:56:04,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:56:04,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:56:04,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:56:04 BasicIcfg [2022-12-05 22:56:04,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:56:04,645 INFO L158 Benchmark]: Toolchain (without parser) took 27182.91ms. Allocated memory was 197.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 173.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 929.3MB. Max. memory is 8.0GB. [2022-12-05 22:56:04,646 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory was 174.9MB in the beginning and 174.8MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:56:04,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.97ms. Allocated memory is still 197.1MB. Free memory was 172.5MB in the beginning and 144.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:56:04,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.19ms. Allocated memory is still 197.1MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:56:04,646 INFO L158 Benchmark]: Boogie Preprocessor took 54.84ms. Allocated memory is still 197.1MB. Free memory was 142.1MB in the beginning and 139.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:56:04,647 INFO L158 Benchmark]: RCFGBuilder took 826.93ms. Allocated memory is still 197.1MB. Free memory was 139.8MB in the beginning and 102.3MB in the end (delta: 37.5MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 22:56:04,647 INFO L158 Benchmark]: TraceAbstraction took 25651.63ms. Allocated memory was 197.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 101.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 859.0MB. Max. memory is 8.0GB. [2022-12-05 22:56:04,648 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.16ms. Allocated memory is still 197.1MB. Free memory was 174.9MB in the beginning and 174.8MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 581.97ms. Allocated memory is still 197.1MB. Free memory was 172.5MB in the beginning and 144.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.19ms. Allocated memory is still 197.1MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.84ms. Allocated memory is still 197.1MB. Free memory was 142.1MB in the beginning and 139.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 826.93ms. Allocated memory is still 197.1MB. Free memory was 139.8MB in the beginning and 102.3MB in the end (delta: 37.5MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 25651.63ms. Allocated memory was 197.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 101.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 859.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 138 PlacesBefore, 48 PlacesAfterwards, 127 TransitionsBefore, 36 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2125, independent: 2052, independent conditional: 2052, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2125, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2125, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2125, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1810, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1810, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2125, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1810, unknown conditional: 0, unknown unconditional: 1810] , Statistics on independence cache: Total cache size (in pairs): 2614, Positive cache size: 2567, Positive conditional cache size: 0, Positive unconditional cache size: 2567, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, 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, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 169, independent: 144, independent conditional: 19, independent unconditional: 125, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 169, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 83, dependent conditional: 47, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 169, unknown conditional: 29, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 144, Positive conditional cache size: 19, Positive unconditional cache size: 125, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 139, independent conditional: 139, 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: 158, independent: 139, independent conditional: 23, independent unconditional: 116, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 139, independent conditional: 0, independent unconditional: 139, 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: 158, independent: 139, independent conditional: 0, independent unconditional: 139, 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: 23, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 161, Positive conditional cache size: 19, Positive unconditional cache size: 142, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 178, independent: 152, independent conditional: 17, independent unconditional: 135, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 163, Positive conditional cache size: 19, Positive unconditional cache size: 144, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 190, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 54, independent unconditional: 136, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 163, Positive conditional cache size: 19, Positive unconditional cache size: 144, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 42, independent unconditional: 95, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 137, independent conditional: 6, independent unconditional: 131, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 6, independent unconditional: 131, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, independent: 135, independent conditional: 6, independent unconditional: 129, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 165, Positive conditional cache size: 19, Positive unconditional cache size: 146, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 134, independent conditional: 43, independent unconditional: 91, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 34, dependent conditional: 0, dependent unconditional: 34, 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: 168, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 165, Positive conditional cache size: 19, Positive unconditional cache size: 146, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 140, independent conditional: 44, independent unconditional: 96, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 140, independent conditional: 6, independent unconditional: 134, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 140, independent conditional: 6, independent unconditional: 134, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 140, independent conditional: 6, independent unconditional: 134, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 165, Positive conditional cache size: 19, Positive unconditional cache size: 146, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 62 PlacesBefore, 62 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 141, independent conditional: 100, independent unconditional: 41, dependent: 36, dependent conditional: 22, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 141, independent conditional: 55, independent unconditional: 86, dependent: 36, dependent conditional: 22, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 141, independent conditional: 55, independent unconditional: 86, dependent: 36, dependent conditional: 22, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, independent: 136, independent conditional: 54, independent unconditional: 82, dependent: 32, dependent conditional: 18, dependent unconditional: 14, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 172, Positive conditional cache size: 20, Positive unconditional cache size: 152, Negative cache size: 43, Negative conditional cache size: 14, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 65 PlacesBefore, 63 PlacesAfterwards, 60 TransitionsBefore, 58 TransitionsAfterwards, 848 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 124, independent conditional: 100, independent unconditional: 24, dependent: 36, dependent conditional: 22, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 124, independent conditional: 52, independent unconditional: 72, dependent: 36, dependent conditional: 22, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 124, independent conditional: 52, independent unconditional: 72, dependent: 36, dependent conditional: 22, dependent unconditional: 14, 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: 160, independent: 124, independent conditional: 52, independent unconditional: 72, dependent: 36, dependent conditional: 22, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 172, Positive conditional cache size: 20, Positive unconditional cache size: 152, Negative cache size: 43, Negative conditional cache size: 14, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 33, independent conditional: 33, 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: 47, independent: 33, independent conditional: 28, independent unconditional: 5, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 33, independent conditional: 21, independent unconditional: 12, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 33, independent conditional: 21, independent unconditional: 12, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 30, independent conditional: 18, independent unconditional: 12, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 175, Positive conditional cache size: 23, Positive unconditional cache size: 152, Negative cache size: 43, Negative conditional cache size: 14, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 22, independent conditional: 20, independent unconditional: 2, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 20, independent unconditional: 2, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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: 34, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 178, Positive conditional cache size: 26, Positive unconditional cache size: 152, Negative cache size: 43, Negative conditional cache size: 14, Negative unconditional cache size: 29, 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.2s, 64 PlacesBefore, 61 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 190, independent conditional: 190, 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: 206, independent: 190, independent conditional: 116, independent unconditional: 74, 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: 206, independent: 190, independent conditional: 116, independent unconditional: 74, 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: 206, independent: 190, independent conditional: 116, independent unconditional: 74, 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: 26, independent: 25, independent conditional: 13, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 165, independent conditional: 103, independent unconditional: 62, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 26, unknown conditional: 13, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 238, Positive conditional cache size: 41, Positive unconditional cache size: 197, Negative cache size: 44, Negative conditional cache size: 14, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 58 PlacesBefore, 60 PlacesAfterwards, 37 TransitionsBefore, 38 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 228, independent: 204, independent conditional: 120, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 228, independent: 204, independent conditional: 116, independent unconditional: 88, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 228, independent: 204, independent conditional: 116, independent unconditional: 88, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 9, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, independent: 191, independent conditional: 107, independent unconditional: 84, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 14, unknown conditional: 9, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 251, Positive conditional cache size: 50, Positive unconditional cache size: 201, Negative cache size: 45, Negative conditional cache size: 14, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t465; [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=0, t465={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t466; [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=1, t465={6:0}, t466={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t467; [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=2, t465={6:0}, t466={7:0}, t467={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t468; [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=3, t465={6:0}, t466={7:0}, t467={8:0}, t468={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L822] 4 z = 1 [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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: 871]: 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: 873]: 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: 869]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1405 IncrementalHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 36 mSDtfsCounter, 1405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=10, InterpolantAutomatonStates: 60, 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.3s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 22:56:04,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...