/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:10:36,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:10:36,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:10:36,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:10:36,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:10:36,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:10:36,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:10:36,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:10:36,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:10:36,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:10:36,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:10:36,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:10:36,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:10:36,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:10:36,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:10:36,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:10:36,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:10:36,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:10:36,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:10:36,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:10:36,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:10:36,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:10:36,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:10:36,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:10:36,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:10:36,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:10:36,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:10:36,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:10:36,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:10:36,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:10:36,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:10:36,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:10:36,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:10:36,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:10:36,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:10:36,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:10:36,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:10:36,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:10:36,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:10:36,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:10:36,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:10:36,561 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:10:36,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:10:36,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:10:36,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:10:36,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:10:36,591 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:10:36,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:10:36,592 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:10:36,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:10:36,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:10:36,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:10:36,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:10:36,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:10:36,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:10:36,593 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:10:36,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:36,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:10:36,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:10:36,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:10:36,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:10:36,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:10:36,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:10:36,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:10:36,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:10:36,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:10:36,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:10:36,904 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:10:36,904 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:10:36,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-06 04:10:37,976 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:10:38,247 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:10:38,247 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-06 04:10:38,269 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329432315/7aa5ca9e23d741e9bd558d07b79dce03/FLAG84a4f6a3a [2022-12-06 04:10:38,295 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329432315/7aa5ca9e23d741e9bd558d07b79dce03 [2022-12-06 04:10:38,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:10:38,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:10:38,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:38,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:10:38,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:10:38,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7692f6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38, skipping insertion in model container [2022-12-06 04:10:38,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:10:38,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:10:38,540 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-12-06 04:10:38,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:38,769 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:10:38,778 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-12-06 04:10:38,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:38,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:38,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:38,870 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:10:38,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38 WrapperNode [2022-12-06 04:10:38,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:38,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:38,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:10:38,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:10:38,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,936 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-12-06 04:10:38,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:38,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:10:38,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:10:38,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:10:38,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,982 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:10:38,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:10:38,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:10:38,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:10:38,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (1/1) ... [2022-12-06 04:10:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:39,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:10:39,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:10:39,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:10:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:10:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:10:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:10:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:10:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:10:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:10:39,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:10:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:10:39,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:10:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:10:39,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:10:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:10:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:10:39,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:10:39,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:10:39,063 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:10:39,245 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:10:39,246 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:10:39,579 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:10:39,660 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:10:39,660 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:10:39,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:39 BoogieIcfgContainer [2022-12-06 04:10:39,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:10:39,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:10:39,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:10:39,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:10:39,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:10:38" (1/3) ... [2022-12-06 04:10:39,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921291a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:39, skipping insertion in model container [2022-12-06 04:10:39,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:38" (2/3) ... [2022-12-06 04:10:39,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921291a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:39, skipping insertion in model container [2022-12-06 04:10:39,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:39" (3/3) ... [2022-12-06 04:10:39,670 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-06 04:10:39,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:10:39,685 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:10:39,685 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:10:39,729 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:10:39,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 04:10:39,815 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 04:10:39,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:39,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 04:10:39,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 04:10:39,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-06 04:10:39,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:39,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 04:10:39,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-06 04:10:39,882 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 04:10:39,882 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:39,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 04:10:39,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 04:10:39,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 2240 [2022-12-06 04:10:43,795 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-06 04:10:43,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:10:43,810 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;@2f99740b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:10:43,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:10:43,812 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:10:43,812 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:43,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:43,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:10:43,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash 490211, now seen corresponding path program 1 times [2022-12-06 04:10:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:43,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062632646] [2022-12-06 04:10:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:43,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:44,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:44,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062632646] [2022-12-06 04:10:44,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062632646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:44,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:44,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508395673] [2022-12-06 04:10:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:44,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:44,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:44,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:44,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 04:10:44,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 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-06 04:10:44,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:44,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 04:10:44,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:44,418 INFO L130 PetriNetUnfolder]: 1416/2239 cut-off events. [2022-12-06 04:10:44,418 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 04:10:44,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4388 conditions, 2239 events. 1416/2239 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12236 event pairs, 176 based on Foata normal form. 0/2010 useless extension candidates. Maximal degree in co-relation 4377. Up to 1781 conditions per place. [2022-12-06 04:10:44,432 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 32 selfloop transitions, 2 changer transitions 8/45 dead transitions. [2022-12-06 04:10:44,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 189 flow [2022-12-06 04:10:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 04:10:44,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2022-12-06 04:10:44,442 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 56 transitions. [2022-12-06 04:10:44,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 189 flow [2022-12-06 04:10:44,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:44,446 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 56 flow [2022-12-06 04:10:44,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 04:10:44,451 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 04:10:44,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:44,452 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 56 flow [2022-12-06 04:10:44,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:44,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:44,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 56 flow [2022-12-06 04:10:44,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2022-12-06 04:10:44,470 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:10:44,470 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:44,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:10:44,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2022-12-06 04:10:44,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 04:10:44,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:44,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 04:10:44,695 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 04:10:44,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-06 04:10:44,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:44,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:44,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:10:44,698 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 473099384, now seen corresponding path program 1 times [2022-12-06 04:10:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490643664] [2022-12-06 04:10:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:44,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:44,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490643664] [2022-12-06 04:10:44,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490643664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:44,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:44,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941827067] [2022-12-06 04:10:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:44,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:44,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:44,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:44,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:44,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:10:44,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:44,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:44,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:10:44,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:45,291 INFO L130 PetriNetUnfolder]: 2041/3069 cut-off events. [2022-12-06 04:10:45,291 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 04:10:45,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6415 conditions, 3069 events. 2041/3069 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14671 event pairs, 649 based on Foata normal form. 92/3161 useless extension candidates. Maximal degree in co-relation 6405. Up to 2180 conditions per place. [2022-12-06 04:10:45,308 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-06 04:10:45,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 180 flow [2022-12-06 04:10:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 04:10:45,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-06 04:10:45,310 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 42 transitions. [2022-12-06 04:10:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 180 flow [2022-12-06 04:10:45,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:45,312 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 104 flow [2022-12-06 04:10:45,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-06 04:10:45,312 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2022-12-06 04:10:45,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:45,313 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 104 flow [2022-12-06 04:10:45,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:45,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:45,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 104 flow [2022-12-06 04:10:45,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 104 flow [2022-12-06 04:10:45,338 INFO L130 PetriNetUnfolder]: 72/230 cut-off events. [2022-12-06 04:10:45,338 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 04:10:45,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 230 events. 72/230 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1304 event pairs, 36 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 427. Up to 117 conditions per place. [2022-12-06 04:10:45,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 104 flow [2022-12-06 04:10:45,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:10:45,399 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:45,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 04:10:45,401 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 104 flow [2022-12-06 04:10:45,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:45,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:45,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:45,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:10:45,402 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1781179995, now seen corresponding path program 1 times [2022-12-06 04:10:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:45,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933390736] [2022-12-06 04:10:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:45,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933390736] [2022-12-06 04:10:45,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933390736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:45,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:45,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449821239] [2022-12-06 04:10:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:45,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:45,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:10:45,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:45,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:45,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:10:45,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:45,954 INFO L130 PetriNetUnfolder]: 1587/2460 cut-off events. [2022-12-06 04:10:45,954 INFO L131 PetriNetUnfolder]: For 894/903 co-relation queries the response was YES. [2022-12-06 04:10:45,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5980 conditions, 2460 events. 1587/2460 cut-off events. For 894/903 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12062 event pairs, 542 based on Foata normal form. 40/2454 useless extension candidates. Maximal degree in co-relation 5968. Up to 1696 conditions per place. [2022-12-06 04:10:45,969 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 30 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 04:10:45,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 194 flow [2022-12-06 04:10:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:10:45,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-06 04:10:45,972 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 104 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:10:45,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 194 flow [2022-12-06 04:10:45,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:45,980 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 101 flow [2022-12-06 04:10:45,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-06 04:10:45,981 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2022-12-06 04:10:45,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:45,982 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 101 flow [2022-12-06 04:10:45,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:45,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:45,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 101 flow [2022-12-06 04:10:45,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 101 flow [2022-12-06 04:10:46,000 INFO L130 PetriNetUnfolder]: 48/163 cut-off events. [2022-12-06 04:10:46,001 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 04:10:46,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 163 events. 48/163 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 778 event pairs, 16 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 295. Up to 83 conditions per place. [2022-12-06 04:10:46,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 101 flow [2022-12-06 04:10:46,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:10:46,007 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:46,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 04:10:46,008 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 101 flow [2022-12-06 04:10:46,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:46,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:46,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:46,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:10:46,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash -619221903, now seen corresponding path program 1 times [2022-12-06 04:10:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:46,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150202483] [2022-12-06 04:10:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:46,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150202483] [2022-12-06 04:10:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150202483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:46,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:46,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116792483] [2022-12-06 04:10:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:46,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:46,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:10:46,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 101 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-06 04:10:46,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:46,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:10:46,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:46,595 INFO L130 PetriNetUnfolder]: 1818/2742 cut-off events. [2022-12-06 04:10:46,596 INFO L131 PetriNetUnfolder]: For 675/675 co-relation queries the response was YES. [2022-12-06 04:10:46,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6817 conditions, 2742 events. 1818/2742 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12875 event pairs, 504 based on Foata normal form. 20/2762 useless extension candidates. Maximal degree in co-relation 6804. Up to 1722 conditions per place. [2022-12-06 04:10:46,611 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2022-12-06 04:10:46,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 289 flow [2022-12-06 04:10:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 04:10:46,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 04:10:46,613 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 101 flow. Second operand 4 states and 52 transitions. [2022-12-06 04:10:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 289 flow [2022-12-06 04:10:46,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:46,618 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 154 flow [2022-12-06 04:10:46,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-06 04:10:46,620 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2022-12-06 04:10:46,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:46,620 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 154 flow [2022-12-06 04:10:46,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:46,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:46,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 154 flow [2022-12-06 04:10:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 154 flow [2022-12-06 04:10:46,638 INFO L130 PetriNetUnfolder]: 39/144 cut-off events. [2022-12-06 04:10:46,638 INFO L131 PetriNetUnfolder]: For 87/97 co-relation queries the response was YES. [2022-12-06 04:10:46,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 144 events. 39/144 cut-off events. For 87/97 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 668 event pairs, 14 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 337. Up to 70 conditions per place. [2022-12-06 04:10:46,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 154 flow [2022-12-06 04:10:46,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 04:10:46,643 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:46,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 04:10:46,644 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 154 flow [2022-12-06 04:10:46,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-06 04:10:46,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:46,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:46,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:10:46,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1978019260, now seen corresponding path program 1 times [2022-12-06 04:10:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:46,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859765324] [2022-12-06 04:10:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859765324] [2022-12-06 04:10:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859765324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:46,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:46,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522739850] [2022-12-06 04:10:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:46,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:46,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:10:46,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:46,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:46,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:10:46,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:46,988 INFO L130 PetriNetUnfolder]: 1038/1782 cut-off events. [2022-12-06 04:10:46,988 INFO L131 PetriNetUnfolder]: For 1518/1615 co-relation queries the response was YES. [2022-12-06 04:10:46,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 1782 events. 1038/1782 cut-off events. For 1518/1615 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9945 event pairs, 243 based on Foata normal form. 187/1924 useless extension candidates. Maximal degree in co-relation 4693. Up to 653 conditions per place. [2022-12-06 04:10:46,997 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 54 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-06 04:10:46,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 418 flow [2022-12-06 04:10:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:10:46,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-06 04:10:46,999 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 154 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:10:46,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 67 transitions, 418 flow [2022-12-06 04:10:47,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:47,003 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 189 flow [2022-12-06 04:10:47,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 04:10:47,004 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2022-12-06 04:10:47,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:47,004 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 189 flow [2022-12-06 04:10:47,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:47,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:47,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 189 flow [2022-12-06 04:10:47,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 189 flow [2022-12-06 04:10:47,025 INFO L130 PetriNetUnfolder]: 111/336 cut-off events. [2022-12-06 04:10:47,025 INFO L131 PetriNetUnfolder]: For 160/204 co-relation queries the response was YES. [2022-12-06 04:10:47,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 336 events. 111/336 cut-off events. For 160/204 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2199 event pairs, 42 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 858. Up to 187 conditions per place. [2022-12-06 04:10:47,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 189 flow [2022-12-06 04:10:47,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 04:10:47,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:47,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 04:10:47,196 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 191 flow [2022-12-06 04:10:47,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:47,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:47,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:47,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:10:47,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash 635352741, now seen corresponding path program 1 times [2022-12-06 04:10:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:47,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260109568] [2022-12-06 04:10:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:47,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260109568] [2022-12-06 04:10:47,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260109568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:47,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:47,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993096078] [2022-12-06 04:10:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:47,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:47,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:10:47,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 191 flow. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:47,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:47,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:10:47,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:47,568 INFO L130 PetriNetUnfolder]: 1386/2324 cut-off events. [2022-12-06 04:10:47,568 INFO L131 PetriNetUnfolder]: For 2831/2831 co-relation queries the response was YES. [2022-12-06 04:10:47,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7902 conditions, 2324 events. 1386/2324 cut-off events. For 2831/2831 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12562 event pairs, 164 based on Foata normal form. 30/2354 useless extension candidates. Maximal degree in co-relation 7883. Up to 933 conditions per place. [2022-12-06 04:10:47,576 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 63 selfloop transitions, 16 changer transitions 12/91 dead transitions. [2022-12-06 04:10:47,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 91 transitions, 619 flow [2022-12-06 04:10:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-06 04:10:47,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 04:10:47,577 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 191 flow. Second operand 6 states and 74 transitions. [2022-12-06 04:10:47,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 91 transitions, 619 flow [2022-12-06 04:10:47,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 91 transitions, 591 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:47,581 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 255 flow [2022-12-06 04:10:47,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 04:10:47,582 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-06 04:10:47,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:47,582 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 255 flow [2022-12-06 04:10:47,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:47,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:47,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 255 flow [2022-12-06 04:10:47,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 255 flow [2022-12-06 04:10:47,612 INFO L130 PetriNetUnfolder]: 133/414 cut-off events. [2022-12-06 04:10:47,612 INFO L131 PetriNetUnfolder]: For 259/289 co-relation queries the response was YES. [2022-12-06 04:10:47,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 414 events. 133/414 cut-off events. For 259/289 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2723 event pairs, 55 based on Foata normal form. 5/397 useless extension candidates. Maximal degree in co-relation 1016. Up to 221 conditions per place. [2022-12-06 04:10:47,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 255 flow [2022-12-06 04:10:47,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-06 04:10:47,633 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:47,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:10:47,633 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 255 flow [2022-12-06 04:10:47,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:47,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:47,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:47,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:10:47,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2051537905, now seen corresponding path program 1 times [2022-12-06 04:10:47,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:47,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12596595] [2022-12-06 04:10:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:47,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12596595] [2022-12-06 04:10:47,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12596595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:47,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:47,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116788368] [2022-12-06 04:10:47,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:47,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:47,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:47,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:47,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:47,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:10:47,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:47,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:47,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:10:47,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:47,931 INFO L130 PetriNetUnfolder]: 744/1402 cut-off events. [2022-12-06 04:10:47,931 INFO L131 PetriNetUnfolder]: For 1663/1747 co-relation queries the response was YES. [2022-12-06 04:10:47,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 1402 events. 744/1402 cut-off events. For 1663/1747 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8233 event pairs, 121 based on Foata normal form. 192/1555 useless extension candidates. Maximal degree in co-relation 4285. Up to 598 conditions per place. [2022-12-06 04:10:47,937 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 65 selfloop transitions, 8 changer transitions 2/85 dead transitions. [2022-12-06 04:10:47,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 642 flow [2022-12-06 04:10:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:10:47,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2022-12-06 04:10:47,938 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 255 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:10:47,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 642 flow [2022-12-06 04:10:47,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 640 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:10:47,941 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 306 flow [2022-12-06 04:10:47,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-06 04:10:47,941 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-06 04:10:47,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:47,941 INFO L89 Accepts]: Start accepts. Operand has 53 places, 44 transitions, 306 flow [2022-12-06 04:10:47,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:47,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:47,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 306 flow [2022-12-06 04:10:47,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 306 flow [2022-12-06 04:10:47,976 INFO L130 PetriNetUnfolder]: 114/390 cut-off events. [2022-12-06 04:10:47,976 INFO L131 PetriNetUnfolder]: For 602/637 co-relation queries the response was YES. [2022-12-06 04:10:47,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 390 events. 114/390 cut-off events. For 602/637 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2642 event pairs, 13 based on Foata normal form. 23/399 useless extension candidates. Maximal degree in co-relation 1309. Up to 191 conditions per place. [2022-12-06 04:10:47,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 306 flow [2022-12-06 04:10:47,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-06 04:10:48,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:48,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 04:10:48,118 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 310 flow [2022-12-06 04:10:48,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:48,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:48,118 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-06 04:10:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:10:48,119 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash -683530824, now seen corresponding path program 1 times [2022-12-06 04:10:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:48,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603283542] [2022-12-06 04:10:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:48,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603283542] [2022-12-06 04:10:48,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603283542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:48,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:48,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889016699] [2022-12-06 04:10:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:48,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:48,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:10:48,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:48,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:48,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:10:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:48,470 INFO L130 PetriNetUnfolder]: 481/928 cut-off events. [2022-12-06 04:10:48,471 INFO L131 PetriNetUnfolder]: For 1810/1854 co-relation queries the response was YES. [2022-12-06 04:10:48,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3423 conditions, 928 events. 481/928 cut-off events. For 1810/1854 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5081 event pairs, 117 based on Foata normal form. 60/956 useless extension candidates. Maximal degree in co-relation 3398. Up to 337 conditions per place. [2022-12-06 04:10:48,476 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 38 selfloop transitions, 11 changer transitions 19/72 dead transitions. [2022-12-06 04:10:48,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 583 flow [2022-12-06 04:10:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 04:10:48,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 04:10:48,477 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 310 flow. Second operand 6 states and 66 transitions. [2022-12-06 04:10:48,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 583 flow [2022-12-06 04:10:48,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 542 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 04:10:48,484 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 221 flow [2022-12-06 04:10:48,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2022-12-06 04:10:48,484 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2022-12-06 04:10:48,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:48,485 INFO L89 Accepts]: Start accepts. Operand has 54 places, 33 transitions, 221 flow [2022-12-06 04:10:48,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:48,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:48,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 33 transitions, 221 flow [2022-12-06 04:10:48,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 33 transitions, 221 flow [2022-12-06 04:10:48,498 INFO L130 PetriNetUnfolder]: 24/106 cut-off events. [2022-12-06 04:10:48,498 INFO L131 PetriNetUnfolder]: For 165/169 co-relation queries the response was YES. [2022-12-06 04:10:48,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 106 events. 24/106 cut-off events. For 165/169 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 431 event pairs, 3 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 356. Up to 29 conditions per place. [2022-12-06 04:10:48,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 33 transitions, 221 flow [2022-12-06 04:10:48,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 04:10:48,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L831-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [458] L853-3-->L856: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_87) 1 0) 0) 0 1) v_~main$tmp_guard0~0_46) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:10:48,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [419] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [458] L853-3-->L856: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_87) 1 0) 0) 0 1) v_~main$tmp_guard0~0_46) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:10:48,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L775-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_7|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] and [458] L853-3-->L856: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_87) 1 0) 0) 0 1) v_~main$tmp_guard0~0_46) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:10:49,409 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:10:49,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 925 [2022-12-06 04:10:49,410 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 221 flow [2022-12-06 04:10:49,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:49,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:49,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:49,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:10:49,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1050334597, now seen corresponding path program 1 times [2022-12-06 04:10:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:49,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009009935] [2022-12-06 04:10:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:49,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:49,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009009935] [2022-12-06 04:10:49,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009009935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:49,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:49,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73770446] [2022-12-06 04:10:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:49,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:49,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:49,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:10:49,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 221 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:49,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:49,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:10:49,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:49,656 INFO L130 PetriNetUnfolder]: 266/519 cut-off events. [2022-12-06 04:10:49,657 INFO L131 PetriNetUnfolder]: For 1567/1567 co-relation queries the response was YES. [2022-12-06 04:10:49,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 519 events. 266/519 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2372 event pairs, 62 based on Foata normal form. 3/522 useless extension candidates. Maximal degree in co-relation 1991. Up to 302 conditions per place. [2022-12-06 04:10:49,659 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 32 selfloop transitions, 4 changer transitions 9/45 dead transitions. [2022-12-06 04:10:49,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 387 flow [2022-12-06 04:10:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:10:49,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 04:10:49,661 INFO L175 Difference]: Start difference. First operand has 49 places, 29 transitions, 221 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:10:49,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 387 flow [2022-12-06 04:10:49,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 279 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-12-06 04:10:49,665 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 125 flow [2022-12-06 04:10:49,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2022-12-06 04:10:49,666 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2022-12-06 04:10:49,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:49,666 INFO L89 Accepts]: Start accepts. Operand has 40 places, 24 transitions, 125 flow [2022-12-06 04:10:49,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:49,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:49,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 125 flow [2022-12-06 04:10:49,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 125 flow [2022-12-06 04:10:49,671 INFO L130 PetriNetUnfolder]: 6/37 cut-off events. [2022-12-06 04:10:49,671 INFO L131 PetriNetUnfolder]: For 52/60 co-relation queries the response was YES. [2022-12-06 04:10:49,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 37 events. 6/37 cut-off events. For 52/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 4/39 useless extension candidates. Maximal degree in co-relation 87. Up to 12 conditions per place. [2022-12-06 04:10:49,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 125 flow [2022-12-06 04:10:49,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 04:10:50,234 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:10:50,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 569 [2022-12-06 04:10:50,235 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 113 flow [2022-12-06 04:10:50,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:50,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:50,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:50,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:10:50,236 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1514711728, now seen corresponding path program 1 times [2022-12-06 04:10:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:50,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736556363] [2022-12-06 04:10:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:50,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736556363] [2022-12-06 04:10:50,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736556363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:50,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:50,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:50,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318147817] [2022-12-06 04:10:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:50,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:10:50,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:10:50,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:10:50,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:10:50,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 113 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-06 04:10:50,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:50,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:10:50,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:50,764 INFO L130 PetriNetUnfolder]: 97/189 cut-off events. [2022-12-06 04:10:50,765 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-12-06 04:10:50,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 189 events. 97/189 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 654 event pairs, 5 based on Foata normal form. 3/192 useless extension candidates. Maximal degree in co-relation 579. Up to 105 conditions per place. [2022-12-06 04:10:50,766 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 25 selfloop transitions, 6 changer transitions 14/45 dead transitions. [2022-12-06 04:10:50,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 296 flow [2022-12-06 04:10:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-06 04:10:50,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-06 04:10:50,767 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 113 flow. Second operand 6 states and 40 transitions. [2022-12-06 04:10:50,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 296 flow [2022-12-06 04:10:50,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 256 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-06 04:10:50,768 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 102 flow [2022-12-06 04:10:50,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-06 04:10:50,768 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 04:10:50,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:50,768 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 102 flow [2022-12-06 04:10:50,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:50,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:50,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 102 flow [2022-12-06 04:10:50,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 102 flow [2022-12-06 04:10:50,773 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 04:10:50,773 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:10:50,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 28 events. 6/28 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 62. Up to 8 conditions per place. [2022-12-06 04:10:50,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 102 flow [2022-12-06 04:10:50,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 04:10:50,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] L831-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd0~0_148 256) 0))) (.cse2 (not (= (mod v_~a$w_buff0_used~0_455 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_155 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_456 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_409 256) 0)) .cse3))) (and (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_95) (= v_~z~0_103 2) (= v_~__unbuffered_p0_EAX~0_110 1) (= v_~__unbuffered_p0_EBX~0_95 0) (= v_~__unbuffered_p2_EBX~0_102 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= (mod v_~main$tmp_guard0~0_98 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~a$r_buff0_thd0~0_154 (ite .cse0 0 v_~a$r_buff0_thd0~0_155)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_409) v_~a$w_buff1_used~0_408) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_P2Thread1of1ForFork0_#res.offset_21| 0) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_159 3) 1 0)) 0 1) v_~main$tmp_guard0~0_98) (= v_~__unbuffered_cnt~0_159 (+ v_~__unbuffered_cnt~0_160 1)) (= v_~a$r_buff1_thd0~0_147 (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd0~0_154 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_408 256) 0)) .cse3)) 0 v_~a$r_buff1_thd0~0_148)) (= (ite .cse4 0 v_~a$w_buff0_used~0_456) v_~a$w_buff0_used~0_455) (= |v_P2Thread1of1ForFork0_#res.base_21| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| (mod v_~main$tmp_guard1~0_80 256)) (= v_~a~0_352 (ite .cse4 v_~a$w_buff0~0_277 (ite .cse1 v_~a$w_buff1~0_230 v_~a~0_353)))))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_95, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_155, ~a~0=v_~a~0_353, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~a$w_buff1~0=v_~a$w_buff1~0_230, ~a$w_buff0~0=v_~a$w_buff0~0_277, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_148, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_160, ~z~0=v_~z~0_103, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_409} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_95, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_154, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_98, ~a~0=v_~a~0_352, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~a$w_buff1~0=v_~a$w_buff1~0_230, ~a$w_buff0~0=v_~a$w_buff0~0_277, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~z~0=v_~z~0_103, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_408, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, P2Thread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, P2Thread1of1ForFork0_#res.offset] and [482] $Ultimate##0-->L768: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| 0)) (= v_~a$r_buff0_thd1~0_168 1) (= v_~a$w_buff0_used~0_483 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_41| |v_P0Thread1of1ForFork1_#in~arg#1.offset_41|) (= v_~__unbuffered_p0_EBX~0_103 v_~y~0_42) (= v_~a$r_buff0_thd1~0_169 v_~a$r_buff1_thd1~0_123) (= v_~a$w_buff0~0_294 v_~a$w_buff1~0_245) (= |v_P0Thread1of1ForFork1_~arg#1.base_41| |v_P0Thread1of1ForFork1_#in~arg#1.base_41|) (= v_~a$w_buff0~0_293 1) (= v_~a$r_buff0_thd2~0_133 v_~a$r_buff1_thd2~0_136) (= v_~x~0_55 v_~__unbuffered_p0_EAX~0_118) (= v_~a$r_buff0_thd0~0_168 v_~a$r_buff1_thd0~0_161) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_483 256) 0)) (not (= (mod v_~a$w_buff1_used~0_435 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~x~0_55 1) (= v_~a$w_buff0_used~0_484 v_~a$w_buff1_used~0_435) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_47| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|) (= v_~a$r_buff0_thd3~0_209 v_~a$r_buff1_thd3~0_203)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_41|, ~a$w_buff0~0=v_~a$w_buff0~0_294, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_133, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_209, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_484, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_169, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_41|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_168, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_103, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_41|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_123, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_203, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_136, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_133, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_209, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_483, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_168, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_41|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_168, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_41|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_118, ~a$w_buff1~0=v_~a$w_buff1~0_245, ~a$w_buff0~0=v_~a$w_buff0~0_293, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_47|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_161, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_435, ~y~0=v_~y~0_42, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_47|, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0] [2022-12-06 04:10:51,669 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:10:51,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 902 [2022-12-06 04:10:51,670 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 116 flow [2022-12-06 04:10:51,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-06 04:10:51,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:51,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:51,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:10:51,671 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:10:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1570564541, now seen corresponding path program 1 times [2022-12-06 04:10:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:51,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895228765] [2022-12-06 04:10:51,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:51,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:10:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:51,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:10:51,747 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:10:51,748 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:10:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:10:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:10:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:10:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:10:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:10:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:10:51,752 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:51,757 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:10:51,757 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:10:51,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:10:51 BasicIcfg [2022-12-06 04:10:51,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:10:51,819 INFO L158 Benchmark]: Toolchain (without parser) took 13519.87ms. Allocated memory was 201.3MB in the beginning and 467.7MB in the end (delta: 266.3MB). Free memory was 176.8MB in the beginning and 388.0MB in the end (delta: -211.2MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2022-12-06 04:10:51,819 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 177.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:10:51,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.63ms. Allocated memory is still 201.3MB. Free memory was 176.5MB in the beginning and 149.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:10:51,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 201.3MB. Free memory was 149.2MB in the beginning and 147.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:51,820 INFO L158 Benchmark]: Boogie Preprocessor took 48.89ms. Allocated memory is still 201.3MB. Free memory was 147.1MB in the beginning and 145.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:51,820 INFO L158 Benchmark]: RCFGBuilder took 676.44ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 109.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 04:10:51,820 INFO L158 Benchmark]: TraceAbstraction took 12152.75ms. Allocated memory was 201.3MB in the beginning and 467.7MB in the end (delta: 266.3MB). Free memory was 109.4MB in the beginning and 388.0MB in the end (delta: -278.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:10:51,821 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.09ms. Allocated memory is still 201.3MB. Free memory is still 177.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 569.63ms. Allocated memory is still 201.3MB. Free memory was 176.5MB in the beginning and 149.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.40ms. Allocated memory is still 201.3MB. Free memory was 149.2MB in the beginning and 147.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.89ms. Allocated memory is still 201.3MB. Free memory was 147.1MB in the beginning and 145.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 676.44ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 109.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12152.75ms. Allocated memory was 201.3MB in the beginning and 467.7MB in the end (delta: 266.3MB). Free memory was 109.4MB in the beginning and 388.0MB in the end (delta: -278.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 119 PlacesBefore, 39 PlacesAfterwards, 111 TransitionsBefore, 30 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1744, independent: 1680, independent conditional: 1680, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1744, independent: 1680, independent conditional: 0, independent unconditional: 1680, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1744, independent: 1680, independent conditional: 0, independent unconditional: 1680, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1744, independent: 1680, independent conditional: 0, independent unconditional: 1680, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1374, independent: 1332, independent conditional: 0, independent unconditional: 1332, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1374, independent: 1320, independent conditional: 0, independent unconditional: 1320, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 187, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1744, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1374, unknown conditional: 0, unknown unconditional: 1374] , Statistics on independence cache: Total cache size (in pairs): 2043, Positive cache size: 2001, Positive conditional cache size: 0, Positive unconditional cache size: 2001, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 257, independent: 208, independent conditional: 24, independent unconditional: 184, dependent: 49, dependent conditional: 3, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 208, independent conditional: 24, independent unconditional: 184, dependent: 49, dependent conditional: 3, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 208, independent conditional: 24, independent unconditional: 184, dependent: 49, dependent conditional: 3, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 132, independent: 112, independent conditional: 16, independent unconditional: 96, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 132, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 97, dependent conditional: 9, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 96, independent conditional: 8, independent unconditional: 88, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 132, unknown conditional: 18, unknown unconditional: 114] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 112, Positive conditional cache size: 16, Positive unconditional cache size: 96, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, 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, 33 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 41, 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: 55, independent: 41, independent conditional: 9, independent unconditional: 32, dependent: 14, dependent conditional: 7, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 12, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 53, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 118, Positive conditional cache size: 16, Positive unconditional cache size: 102, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 56, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 118, Positive conditional cache size: 16, Positive unconditional cache size: 102, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 18, dependent conditional: 9, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 18, dependent conditional: 0, dependent unconditional: 18, 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: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 120, Positive conditional cache size: 16, Positive unconditional cache size: 104, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 56, independent conditional: 56, 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: 90, independent: 56, independent conditional: 4, independent unconditional: 52, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 56, independent conditional: 1, independent unconditional: 55, 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: 90, independent: 56, independent conditional: 1, independent unconditional: 55, 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: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 51, independent conditional: 1, independent unconditional: 50, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 130, Positive conditional cache size: 16, Positive unconditional cache size: 114, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 132, Positive conditional cache size: 16, Positive unconditional cache size: 116, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 91, independent conditional: 91, 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: 125, independent: 91, independent conditional: 63, independent unconditional: 28, dependent: 34, dependent conditional: 10, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 91, independent conditional: 45, independent unconditional: 46, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 91, independent conditional: 45, independent unconditional: 46, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 85, independent conditional: 39, independent unconditional: 46, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 143, Positive conditional cache size: 22, Positive unconditional cache size: 121, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 53 PlacesBefore, 49 PlacesAfterwards, 33 TransitionsBefore, 29 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 69, independent conditional: 13, independent unconditional: 56, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 69, independent conditional: 13, independent unconditional: 56, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 69, independent conditional: 13, independent unconditional: 56, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 63, independent conditional: 10, independent unconditional: 53, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 184, Positive conditional cache size: 27, Positive unconditional cache size: 157, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 40 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 76, independent conditional: 76, 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: 102, independent: 76, independent conditional: 34, independent unconditional: 42, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 76, independent conditional: 28, independent unconditional: 48, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 76, independent conditional: 28, independent unconditional: 48, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 12, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 57, independent conditional: 16, independent unconditional: 41, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 22, unknown conditional: 12, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 222, Positive conditional cache size: 41, Positive unconditional cache size: 181, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 35 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, independent: 103, independent conditional: 103, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 121, independent: 103, independent conditional: 87, independent unconditional: 16, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 103, independent conditional: 87, independent unconditional: 16, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 103, independent conditional: 87, independent unconditional: 16, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 27, dependent conditional: 16, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, independent: 83, independent conditional: 67, independent unconditional: 16, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 24, unknown conditional: 22, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 262, Positive conditional cache size: 61, Positive unconditional cache size: 201, Negative cache size: 41, Negative conditional cache size: 4, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t633, ((void *)0), P0, ((void *)0))=-2, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t634, ((void *)0), P1, ((void *)0))=-1, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t635, ((void *)0), P2, ((void *)0))=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L784] 2 y = 1 [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 [L807] 3 __unbuffered_p2_EAX = z [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=56, weak$$choice2=0, x=1, y=1, z=2] [L826] 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) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 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 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=56, weak$$choice2=0, x=1, y=1, z=2] [L770] 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) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 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 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L855] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 2 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 2 !(!cond) [L857] RET 2 assume_abort_if_not(main$tmp_guard0) [L859] 2 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 2 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 [L862] 2 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 2 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 [L866] 2 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 17 mSDtfsCounter, 693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=7, InterpolantAutomatonStates: 44, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:10:51,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...