/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:18:01,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:18:01,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:18:01,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:18:01,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:18:01,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:18:01,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:18:01,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:18:01,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:18:01,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:18:01,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:18:01,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:18:01,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:18:01,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:18:01,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:18:01,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:18:01,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:18:01,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:18:01,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:18:01,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:18:01,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:18:01,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:18:01,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:18:01,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:18:01,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:18:01,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:18:01,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:18:01,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:18:01,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:18:01,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:18:01,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:18:01,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:18:01,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:18:01,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:18:01,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:18:01,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:18:01,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:18:01,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:18:01,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:18:01,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:18:01,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:18:01,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:18:01,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:18:01,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:18:01,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:18:01,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:18:01,806 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:18:01,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:18:01,806 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:18:01,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:18:01,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:18:01,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:18:01,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:18:01,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:18:01,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:18:01,808 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:18:01,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:18:01,808 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:18:01,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:18:01,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:18:01,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:18:01,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:18:01,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:18:01,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:18:01,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:18:01,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:18:01,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:18:01,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:18:01,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:18:01,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:18:01,810 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:18:02,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:18:02,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:18:02,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:18:02,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:18:02,115 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:18:02,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:18:03,160 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:18:03,428 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:18:03,428 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:18:03,441 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fe91b2d3/c71470be171c4ede8d6b078f6964f1f5/FLAG8646b56b2 [2022-12-05 23:18:03,455 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fe91b2d3/c71470be171c4ede8d6b078f6964f1f5 [2022-12-05 23:18:03,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:18:03,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:18:03,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:18:03,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:18:03,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:18:03,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1766a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03, skipping insertion in model container [2022-12-05 23:18:03,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:18:03,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:18:03,636 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 23:18:03,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:18:03,798 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:18:03,808 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 23:18:03,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:03,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:03,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:18:03,888 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:18:03,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03 WrapperNode [2022-12-05 23:18:03,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:18:03,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:18:03,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:18:03,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:18:03,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,943 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-05 23:18:03,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:18:03,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:18:03,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:18:03,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:18:03,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:03,982 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:04,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:04,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:18:04,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:18:04,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:18:04,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:18:04,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (1/1) ... [2022-12-05 23:18:04,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:18:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:18:04,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:18:04,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:18:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:18:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:18:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:18:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:18:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:18:04,091 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:18:04,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:18:04,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:18:04,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:18:04,092 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:18:04,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:18:04,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:18:04,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:18:04,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:18:04,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:18:04,094 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:18:04,236 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:18:04,238 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:18:04,512 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:18:04,632 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:18:04,632 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:18:04,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:18:04 BoogieIcfgContainer [2022-12-05 23:18:04,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:18:04,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:18:04,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:18:04,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:18:04,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:18:03" (1/3) ... [2022-12-05 23:18:04,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb99fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:18:04, skipping insertion in model container [2022-12-05 23:18:04,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:03" (2/3) ... [2022-12-05 23:18:04,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb99fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:18:04, skipping insertion in model container [2022-12-05 23:18:04,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:18:04" (3/3) ... [2022-12-05 23:18:04,641 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:18:04,661 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:18:04,662 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:18:04,662 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:18:04,735 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:18:04,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-05 23:18:04,839 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-05 23:18:04,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:04,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:18:04,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-05 23:18:04,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-05 23:18:04,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:04,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-05 23:18:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-05 23:18:04,931 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-05 23:18:04,931 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:04,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:18:04,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-05 23:18:04,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-05 23:18:08,942 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-05 23:18:08,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:18:08,961 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;@7285217e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:18:08,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:18:08,964 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:18:08,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:08,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:08,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:18:08,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 440912804, now seen corresponding path program 1 times [2022-12-05 23:18:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:08,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982716013] [2022-12-05 23:18:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:09,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:09,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982716013] [2022-12-05 23:18:09,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982716013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:09,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:09,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:18:09,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388402471] [2022-12-05 23:18:09,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:09,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:18:09,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:09,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:18:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:18:09,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 23:18:09,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 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-05 23:18:09,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:09,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 23:18:09,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:09,718 INFO L130 PetriNetUnfolder]: 1023/1656 cut-off events. [2022-12-05 23:18:09,719 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:18:09,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3231 conditions, 1656 events. 1023/1656 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8624 event pairs, 168 based on Foata normal form. 0/1504 useless extension candidates. Maximal degree in co-relation 3220. Up to 1228 conditions per place. [2022-12-05 23:18:09,730 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 29 selfloop transitions, 2 changer transitions 6/39 dead transitions. [2022-12-05 23:18:09,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 164 flow [2022-12-05 23:18:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:18:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:18:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-05 23:18:09,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-05 23:18:09,742 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 48 transitions. [2022-12-05 23:18:09,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 164 flow [2022-12-05 23:18:09,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:18:09,745 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-05 23:18:09,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-05 23:18:09,750 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:18:09,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:09,750 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-05 23:18:09,752 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:09,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:09,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-05 23:18:09,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-05 23:18:09,758 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:18:09,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:09,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:18:09,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-05 23:18:09,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-05 23:18:09,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:18:09,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-05 23:18:09,908 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 23:18:09,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-05 23:18:09,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:09,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:09,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:18:09,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -723046172, now seen corresponding path program 1 times [2022-12-05 23:18:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727046398] [2022-12-05 23:18:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:10,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727046398] [2022-12-05 23:18:10,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727046398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:10,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:10,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:18:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390623491] [2022-12-05 23:18:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:10,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:18:10,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:18:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:18:10,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:18:10,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 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-05 23:18:10,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:10,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:18:10,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:10,246 INFO L130 PetriNetUnfolder]: 689/1044 cut-off events. [2022-12-05 23:18:10,246 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 23:18:10,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1044 events. 689/1044 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4296 event pairs, 169 based on Foata normal form. 8/1050 useless extension candidates. Maximal degree in co-relation 2208. Up to 953 conditions per place. [2022-12-05 23:18:10,253 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-05 23:18:10,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 142 flow [2022-12-05 23:18:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:18:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:18:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 23:18:10,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:18:10,255 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 35 transitions. [2022-12-05 23:18:10,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 142 flow [2022-12-05 23:18:10,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:18:10,257 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-05 23:18:10,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-05 23:18:10,258 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-12-05 23:18:10,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:10,258 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-05 23:18:10,259 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:10,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:10,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-05 23:18:10,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-05 23:18:10,265 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-05 23:18:10,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:10,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-05 23:18:10,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-05 23:18:10,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-05 23:18:10,300 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:10,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-05 23:18:10,302 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-05 23:18:10,302 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-05 23:18:10,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:10,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:10,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:18:10,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash -939595004, now seen corresponding path program 1 times [2022-12-05 23:18:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:10,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579656563] [2022-12-05 23:18:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:10,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:10,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579656563] [2022-12-05 23:18:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579656563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:10,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:18:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866045018] [2022-12-05 23:18:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:10,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:18:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:18:10,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:18:10,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:18:10,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:10,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:10,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:18:10,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:10,757 INFO L130 PetriNetUnfolder]: 983/1476 cut-off events. [2022-12-05 23:18:10,757 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-12-05 23:18:10,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1476 events. 983/1476 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6017 event pairs, 131 based on Foata normal form. 20/1496 useless extension candidates. Maximal degree in co-relation 3323. Up to 809 conditions per place. [2022-12-05 23:18:10,768 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-05 23:18:10,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 277 flow [2022-12-05 23:18:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:18:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:18:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 23:18:10,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-05 23:18:10,771 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 5 states and 58 transitions. [2022-12-05 23:18:10,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 277 flow [2022-12-05 23:18:10,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 58 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:18:10,774 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 142 flow [2022-12-05 23:18:10,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-05 23:18:10,775 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-05 23:18:10,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:10,775 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 142 flow [2022-12-05 23:18:10,777 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:10,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:10,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 142 flow [2022-12-05 23:18:10,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 142 flow [2022-12-05 23:18:10,787 INFO L130 PetriNetUnfolder]: 19/79 cut-off events. [2022-12-05 23:18:10,787 INFO L131 PetriNetUnfolder]: For 47/61 co-relation queries the response was YES. [2022-12-05 23:18:10,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 79 events. 19/79 cut-off events. For 47/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 296 event pairs, 3 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 189. Up to 29 conditions per place. [2022-12-05 23:18:10,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 142 flow [2022-12-05 23:18:10,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-05 23:18:10,793 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:10,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-05 23:18:10,794 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 142 flow [2022-12-05 23:18:10,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:10,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:10,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:10,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:18:10,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:10,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1736996602, now seen corresponding path program 1 times [2022-12-05 23:18:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:10,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004808746] [2022-12-05 23:18:10,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:10,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004808746] [2022-12-05 23:18:10,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004808746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:10,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:10,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:18:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699338705] [2022-12-05 23:18:10,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:10,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:18:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:10,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:18:10,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:18:10,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:18:10,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:10,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:10,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:18:10,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:11,169 INFO L130 PetriNetUnfolder]: 882/1347 cut-off events. [2022-12-05 23:18:11,169 INFO L131 PetriNetUnfolder]: For 1051/1051 co-relation queries the response was YES. [2022-12-05 23:18:11,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3760 conditions, 1347 events. 882/1347 cut-off events. For 1051/1051 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5501 event pairs, 201 based on Foata normal form. 10/1352 useless extension candidates. Maximal degree in co-relation 3745. Up to 1094 conditions per place. [2022-12-05 23:18:11,179 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 30 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2022-12-05 23:18:11,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 226 flow [2022-12-05 23:18:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:18:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:18:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-05 23:18:11,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 23:18:11,181 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 142 flow. Second operand 3 states and 31 transitions. [2022-12-05 23:18:11,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 226 flow [2022-12-05 23:18:11,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:18:11,184 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 153 flow [2022-12-05 23:18:11,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-05 23:18:11,185 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-05 23:18:11,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:11,186 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 153 flow [2022-12-05 23:18:11,187 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:11,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:11,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 153 flow [2022-12-05 23:18:11,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 153 flow [2022-12-05 23:18:11,195 INFO L130 PetriNetUnfolder]: 17/66 cut-off events. [2022-12-05 23:18:11,195 INFO L131 PetriNetUnfolder]: For 68/72 co-relation queries the response was YES. [2022-12-05 23:18:11,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 66 events. 17/66 cut-off events. For 68/72 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 231 event pairs, 0 based on Foata normal form. 2/68 useless extension candidates. Maximal degree in co-relation 169. Up to 27 conditions per place. [2022-12-05 23:18:11,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 153 flow [2022-12-05 23:18:11,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-05 23:18:11,200 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:11,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:18:11,205 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 153 flow [2022-12-05 23:18:11,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:11,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:11,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:11,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:18:11,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 937323068, now seen corresponding path program 1 times [2022-12-05 23:18:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:11,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241316185] [2022-12-05 23:18:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:11,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241316185] [2022-12-05 23:18:11,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241316185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:11,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:11,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:18:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442786737] [2022-12-05 23:18:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:11,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:18:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:18:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:18:11,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:18:11,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 153 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:11,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:11,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:18:11,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:11,584 INFO L130 PetriNetUnfolder]: 1101/1672 cut-off events. [2022-12-05 23:18:11,584 INFO L131 PetriNetUnfolder]: For 1972/1972 co-relation queries the response was YES. [2022-12-05 23:18:11,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 1672 events. 1101/1672 cut-off events. For 1972/1972 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7111 event pairs, 337 based on Foata normal form. 70/1742 useless extension candidates. Maximal degree in co-relation 4549. Up to 666 conditions per place. [2022-12-05 23:18:11,592 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 31 selfloop transitions, 5 changer transitions 14/50 dead transitions. [2022-12-05 23:18:11,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 315 flow [2022-12-05 23:18:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:18:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:18:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 23:18:11,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-05 23:18:11,594 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 153 flow. Second operand 4 states and 43 transitions. [2022-12-05 23:18:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 315 flow [2022-12-05 23:18:11,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:18:11,597 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 124 flow [2022-12-05 23:18:11,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2022-12-05 23:18:11,598 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-05 23:18:11,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:11,598 INFO L89 Accepts]: Start accepts. Operand has 41 places, 24 transitions, 124 flow [2022-12-05 23:18:11,599 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:11,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:11,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 124 flow [2022-12-05 23:18:11,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 124 flow [2022-12-05 23:18:11,605 INFO L130 PetriNetUnfolder]: 7/41 cut-off events. [2022-12-05 23:18:11,605 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-12-05 23:18:11,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 41 events. 7/41 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 2 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 109. Up to 15 conditions per place. [2022-12-05 23:18:11,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 124 flow [2022-12-05 23:18:11,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-05 23:18:11,613 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:11,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 23:18:11,614 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 124 flow [2022-12-05 23:18:11,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:11,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:11,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:11,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:18:11,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:11,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1973663963, now seen corresponding path program 1 times [2022-12-05 23:18:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:11,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680745530] [2022-12-05 23:18:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:11,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680745530] [2022-12-05 23:18:11,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680745530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:11,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:11,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:18:11,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263669121] [2022-12-05 23:18:11,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:11,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:18:11,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:11,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:18:11,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:18:11,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:18:11,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:11,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:11,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:18:11,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:11,901 INFO L130 PetriNetUnfolder]: 384/650 cut-off events. [2022-12-05 23:18:11,901 INFO L131 PetriNetUnfolder]: For 1072/1090 co-relation queries the response was YES. [2022-12-05 23:18:11,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 650 events. 384/650 cut-off events. For 1072/1090 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2764 event pairs, 81 based on Foata normal form. 60/696 useless extension candidates. Maximal degree in co-relation 1946. Up to 380 conditions per place. [2022-12-05 23:18:11,906 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 4 changer transitions 24/63 dead transitions. [2022-12-05 23:18:11,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 410 flow [2022-12-05 23:18:11,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:18:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:18:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-05 23:18:11,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-05 23:18:11,910 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 124 flow. Second operand 5 states and 62 transitions. [2022-12-05 23:18:11,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 410 flow [2022-12-05 23:18:11,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 63 transitions, 359 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-05 23:18:11,915 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 135 flow [2022-12-05 23:18:11,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-05 23:18:11,917 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-05 23:18:11,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:11,918 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 135 flow [2022-12-05 23:18:11,918 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:11,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:11,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 135 flow [2022-12-05 23:18:11,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 135 flow [2022-12-05 23:18:11,935 INFO L130 PetriNetUnfolder]: 43/110 cut-off events. [2022-12-05 23:18:11,935 INFO L131 PetriNetUnfolder]: For 136/156 co-relation queries the response was YES. [2022-12-05 23:18:11,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 110 events. 43/110 cut-off events. For 136/156 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 428 event pairs, 21 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 325. Up to 54 conditions per place. [2022-12-05 23:18:11,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 135 flow [2022-12-05 23:18:11,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-05 23:18:11,939 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:11,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-05 23:18:11,940 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 135 flow [2022-12-05 23:18:11,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:11,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:11,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:11,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:18:11,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1337850588, now seen corresponding path program 1 times [2022-12-05 23:18:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049469563] [2022-12-05 23:18:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:12,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049469563] [2022-12-05 23:18:12,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049469563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:12,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:12,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:18:12,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347069982] [2022-12-05 23:18:12,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:12,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:18:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:12,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:18:12,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:18:12,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:18:12,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:12,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:12,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:18:12,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:12,256 INFO L130 PetriNetUnfolder]: 201/372 cut-off events. [2022-12-05 23:18:12,257 INFO L131 PetriNetUnfolder]: For 366/370 co-relation queries the response was YES. [2022-12-05 23:18:12,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 372 events. 201/372 cut-off events. For 366/370 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1410 event pairs, 44 based on Foata normal form. 34/399 useless extension candidates. Maximal degree in co-relation 1232. Up to 126 conditions per place. [2022-12-05 23:18:12,259 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 39 selfloop transitions, 7 changer transitions 20/69 dead transitions. [2022-12-05 23:18:12,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 451 flow [2022-12-05 23:18:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:18:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:18:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-05 23:18:12,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-05 23:18:12,261 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 135 flow. Second operand 6 states and 73 transitions. [2022-12-05 23:18:12,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 451 flow [2022-12-05 23:18:12,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 445 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:18:12,264 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 185 flow [2022-12-05 23:18:12,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-12-05 23:18:12,264 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-05 23:18:12,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:12,265 INFO L89 Accepts]: Start accepts. Operand has 46 places, 30 transitions, 185 flow [2022-12-05 23:18:12,266 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:12,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:12,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 185 flow [2022-12-05 23:18:12,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 30 transitions, 185 flow [2022-12-05 23:18:12,274 INFO L130 PetriNetUnfolder]: 18/64 cut-off events. [2022-12-05 23:18:12,274 INFO L131 PetriNetUnfolder]: For 141/165 co-relation queries the response was YES. [2022-12-05 23:18:12,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 64 events. 18/64 cut-off events. For 141/165 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 165 event pairs, 4 based on Foata normal form. 4/66 useless extension candidates. Maximal degree in co-relation 226. Up to 29 conditions per place. [2022-12-05 23:18:12,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 30 transitions, 185 flow [2022-12-05 23:18:12,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-05 23:18:12,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:12,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-05 23:18:12,287 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 185 flow [2022-12-05 23:18:12,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:12,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:12,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:12,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:18:12,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:12,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1897262092, now seen corresponding path program 1 times [2022-12-05 23:18:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:12,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606606803] [2022-12-05 23:18:12,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:12,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606606803] [2022-12-05 23:18:12,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606606803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:12,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:12,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:18:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556247090] [2022-12-05 23:18:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:12,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:18:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:18:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:18:12,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:18:12,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:12,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:12,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:18:12,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:12,622 INFO L130 PetriNetUnfolder]: 135/256 cut-off events. [2022-12-05 23:18:12,622 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-05 23:18:12,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 256 events. 135/256 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 868 event pairs, 40 based on Foata normal form. 10/261 useless extension candidates. Maximal degree in co-relation 890. Up to 101 conditions per place. [2022-12-05 23:18:12,624 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 36 selfloop transitions, 10 changer transitions 9/58 dead transitions. [2022-12-05 23:18:12,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 423 flow [2022-12-05 23:18:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:18:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:18:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-05 23:18:12,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2022-12-05 23:18:12,625 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 185 flow. Second operand 7 states and 66 transitions. [2022-12-05 23:18:12,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 423 flow [2022-12-05 23:18:12,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 372 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-05 23:18:12,629 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 176 flow [2022-12-05 23:18:12,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2022-12-05 23:18:12,629 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-12-05 23:18:12,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:12,630 INFO L89 Accepts]: Start accepts. Operand has 48 places, 30 transitions, 176 flow [2022-12-05 23:18:12,631 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:12,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:12,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 176 flow [2022-12-05 23:18:12,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 30 transitions, 176 flow [2022-12-05 23:18:12,637 INFO L130 PetriNetUnfolder]: 9/41 cut-off events. [2022-12-05 23:18:12,637 INFO L131 PetriNetUnfolder]: For 56/64 co-relation queries the response was YES. [2022-12-05 23:18:12,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 41 events. 9/41 cut-off events. For 56/64 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 2/42 useless extension candidates. Maximal degree in co-relation 119. Up to 13 conditions per place. [2022-12-05 23:18:12,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 30 transitions, 176 flow [2022-12-05 23:18:12,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:18:13,004 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:18:13,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 375 [2022-12-05 23:18:13,005 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 172 flow [2022-12-05 23:18:13,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:13,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:13,005 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-05 23:18:13,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:18:13,006 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:13,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2097446065, now seen corresponding path program 1 times [2022-12-05 23:18:13,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:13,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627092688] [2022-12-05 23:18:13,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:13,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627092688] [2022-12-05 23:18:13,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627092688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:13,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:13,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:18:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823435199] [2022-12-05 23:18:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:13,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:18:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:13,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:18:13,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:18:13,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:18:13,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:13,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:13,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:18:13,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:13,273 INFO L130 PetriNetUnfolder]: 161/298 cut-off events. [2022-12-05 23:18:13,273 INFO L131 PetriNetUnfolder]: For 513/515 co-relation queries the response was YES. [2022-12-05 23:18:13,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 298 events. 161/298 cut-off events. For 513/515 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1110 event pairs, 22 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 1045. Up to 190 conditions per place. [2022-12-05 23:18:13,275 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 28 selfloop transitions, 1 changer transitions 23/53 dead transitions. [2022-12-05 23:18:13,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 424 flow [2022-12-05 23:18:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:18:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:18:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-05 23:18:13,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-05 23:18:13,277 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 172 flow. Second operand 4 states and 39 transitions. [2022-12-05 23:18:13,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 424 flow [2022-12-05 23:18:13,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 350 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-05 23:18:13,279 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 121 flow [2022-12-05 23:18:13,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2022-12-05 23:18:13,280 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-05 23:18:13,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:13,280 INFO L89 Accepts]: Start accepts. Operand has 43 places, 24 transitions, 121 flow [2022-12-05 23:18:13,281 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:13,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:13,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 24 transitions, 121 flow [2022-12-05 23:18:13,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 121 flow [2022-12-05 23:18:13,286 INFO L130 PetriNetUnfolder]: 6/32 cut-off events. [2022-12-05 23:18:13,287 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-05 23:18:13,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 32 events. 6/32 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 82. Up to 10 conditions per place. [2022-12-05 23:18:13,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 121 flow [2022-12-05 23:18:13,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-05 23:18:13,795 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:18:13,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 516 [2022-12-05 23:18:13,796 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 113 flow [2022-12-05 23:18:13,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:13,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:13,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:13,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:18:13,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1119038029, now seen corresponding path program 1 times [2022-12-05 23:18:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:13,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330617837] [2022-12-05 23:18:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:18:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:14,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330617837] [2022-12-05 23:18:14,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330617837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:14,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:14,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:18:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685897039] [2022-12-05 23:18:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:14,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:18:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:18:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:18:14,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:18:14,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 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-05 23:18:14,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:14,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:18:14,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:14,580 INFO L130 PetriNetUnfolder]: 44/99 cut-off events. [2022-12-05 23:18:14,580 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-05 23:18:14,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 99 events. 44/99 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 300 event pairs, 3 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 353. Up to 48 conditions per place. [2022-12-05 23:18:14,581 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 24 selfloop transitions, 4 changer transitions 14/42 dead transitions. [2022-12-05 23:18:14,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 306 flow [2022-12-05 23:18:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:18:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:18:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-12-05 23:18:14,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-05 23:18:14,582 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 113 flow. Second operand 6 states and 29 transitions. [2022-12-05 23:18:14,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 306 flow [2022-12-05 23:18:14,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 276 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-05 23:18:14,585 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 106 flow [2022-12-05 23:18:14,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2022-12-05 23:18:14,586 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-05 23:18:14,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:14,586 INFO L89 Accepts]: Start accepts. Operand has 38 places, 21 transitions, 106 flow [2022-12-05 23:18:14,592 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:14,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:14,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 106 flow [2022-12-05 23:18:14,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 106 flow [2022-12-05 23:18:14,598 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-05 23:18:14,598 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 23:18:14,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 28 events. 6/28 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 70. Up to 10 conditions per place. [2022-12-05 23:18:14,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 21 transitions, 106 flow [2022-12-05 23:18:14,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-05 23:18:14,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L789-->P1EXIT: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_114 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_154 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_415 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_416 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_363 256) 0))))) (and (= |v_P1Thread1of1ForFork0_#res#1.base_21| 0) (= v_~x$w_buff0_used~0_415 (ite .cse0 0 v_~x$w_buff0_used~0_416)) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_154) v_~x$r_buff0_thd2~0_153) (= |v_P1Thread1of1ForFork0_#res#1.offset_21| 0) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_363) v_~x$w_buff1_used~0_362) (= (ite .cse0 v_~x$w_buff0~0_264 (ite .cse2 v_~x$w_buff1~0_228 v_~x~0_324)) v_~x~0_323) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_362 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_153 256) 0)))) 0 v_~x$r_buff1_thd2~0_114) v_~x$r_buff1_thd2~0_113)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$w_buff1~0=v_~x$w_buff1~0_228, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_154, ~x~0=v_~x~0_324, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_416} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$w_buff1~0=v_~x$w_buff1~0_228, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_362, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_153, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_21|, ~x~0=v_~x~0_323, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [439] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_366 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_135 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_137 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_367 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_317 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~__unbuffered_p2_EAX~0_58 1) (= v_~__unbuffered_p0_EAX~0_79 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (ite .cse0 v_~x$w_buff0~0_236 (ite .cse1 v_~x$w_buff1~0_203 v_~x~0_279)) v_~x~0_278) (= v_~x$r_buff1_thd0~0_134 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_136 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_316 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_135)) (= (ite .cse0 0 v_~x$w_buff0_used~0_367) v_~x$w_buff0_used~0_366) (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_56) (= (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_317) v_~x$w_buff1_used~0_316) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_65| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|) (= (ite .cse4 0 v_~x$r_buff0_thd0~0_137) v_~x$r_buff0_thd0~0_136)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_236, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_137, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ~x$w_buff1~0=v_~x$w_buff1~0_203, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_317, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_135, ~x~0=v_~x~0_279, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_367} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_236, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_51|, ~x$w_buff1~0=v_~x$w_buff1~0_203, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_316, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_134, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_366, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_79, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_65|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~x~0=v_~x~0_278, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:18:15,395 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:18:15,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 810 [2022-12-05 23:18:15,397 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 108 flow [2022-12-05 23:18:15,397 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-05 23:18:15,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:15,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:15,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:18:15,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:18:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash 179933713, now seen corresponding path program 1 times [2022-12-05 23:18:15,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:15,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107073079] [2022-12-05 23:18:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:15,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:18:15,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:18:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:18:15,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:18:15,563 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:18:15,564 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:18:15,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:18:15,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:18:15,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:18:15,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:18:15,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:18:15,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:18:15,566 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:15,573 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:18:15,573 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:18:15,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:18:15 BasicIcfg [2022-12-05 23:18:15,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:18:15,650 INFO L158 Benchmark]: Toolchain (without parser) took 12191.97ms. Allocated memory was 177.2MB in the beginning and 407.9MB in the end (delta: 230.7MB). Free memory was 151.6MB in the beginning and 351.3MB in the end (delta: -199.8MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. [2022-12-05 23:18:15,650 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:18:15,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.37ms. Allocated memory is still 177.2MB. Free memory was 151.0MB in the beginning and 124.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:18:15,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.47ms. Allocated memory is still 177.2MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:18:15,651 INFO L158 Benchmark]: Boogie Preprocessor took 60.01ms. Allocated memory is still 177.2MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:18:15,655 INFO L158 Benchmark]: RCFGBuilder took 628.80ms. Allocated memory is still 177.2MB. Free memory was 120.6MB in the beginning and 89.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 23:18:15,655 INFO L158 Benchmark]: TraceAbstraction took 11013.40ms. Allocated memory was 177.2MB in the beginning and 407.9MB in the end (delta: 230.7MB). Free memory was 88.7MB in the beginning and 351.3MB in the end (delta: -262.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:18:15,657 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.37ms. Allocated memory is still 177.2MB. Free memory was 151.0MB in the beginning and 124.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.47ms. Allocated memory is still 177.2MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.01ms. Allocated memory is still 177.2MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 628.80ms. Allocated memory is still 177.2MB. Free memory was 120.6MB in the beginning and 89.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11013.40ms. Allocated memory was 177.2MB in the beginning and 407.9MB in the end (delta: 230.7MB). Free memory was 88.7MB in the beginning and 351.3MB in the end (delta: -262.7MB). 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: 4.0s, 113 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1407, independent: 1359, independent conditional: 1359, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1407, independent: 1359, independent conditional: 0, independent unconditional: 1359, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1407, independent: 1359, independent conditional: 0, independent unconditional: 1359, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1407, independent: 1359, independent conditional: 0, independent unconditional: 1359, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1135, independent: 1103, independent conditional: 0, independent unconditional: 1103, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1135, independent: 1091, independent conditional: 0, independent unconditional: 1091, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 169, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1407, independent: 256, independent conditional: 0, independent unconditional: 256, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1135, unknown conditional: 0, unknown unconditional: 1135] , Statistics on independence cache: Total cache size (in pairs): 1717, Positive cache size: 1685, Positive conditional cache size: 0, Positive unconditional cache size: 1685, Negative cache size: 32, Negative conditional cache size: 0, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 132, independent conditional: 9, independent unconditional: 123, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 132, independent conditional: 9, independent unconditional: 123, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 132, independent conditional: 9, independent unconditional: 123, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, independent: 69, independent conditional: 5, independent unconditional: 64, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 105, dependent conditional: 14, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 63, independent conditional: 4, independent unconditional: 59, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 87, unknown conditional: 7, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 78, independent conditional: 7, independent unconditional: 71, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 86, Positive conditional cache size: 5, Positive unconditional cache size: 81, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 113, independent conditional: 32, independent unconditional: 81, dependent: 20, dependent conditional: 11, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 87, Positive conditional cache size: 5, Positive unconditional cache size: 82, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 131, independent conditional: 26, independent unconditional: 105, dependent: 21, dependent conditional: 11, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 131, independent conditional: 0, independent unconditional: 131, 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: 158, independent: 131, independent conditional: 0, independent unconditional: 131, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 158, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 94, Positive conditional cache size: 5, Positive unconditional cache size: 89, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 78, independent conditional: 7, independent unconditional: 71, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 94, Positive conditional cache size: 5, Positive unconditional cache size: 89, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 14, independent unconditional: 45, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 59, independent conditional: 8, independent unconditional: 51, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 8, independent unconditional: 51, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 59, independent conditional: 8, independent unconditional: 51, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 94, Positive conditional cache size: 5, Positive unconditional cache size: 89, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 63, independent conditional: 22, independent unconditional: 41, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 63, independent conditional: 16, independent unconditional: 47, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 63, independent conditional: 16, independent unconditional: 47, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 61, independent conditional: 14, independent unconditional: 47, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 96, Positive conditional cache size: 7, Positive unconditional cache size: 89, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 44 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 108, independent conditional: 108, 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: 134, independent: 108, independent conditional: 38, independent unconditional: 70, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 108, independent conditional: 26, independent unconditional: 82, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 108, independent conditional: 26, independent unconditional: 82, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 134, independent: 108, independent conditional: 26, independent unconditional: 82, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 99, Positive conditional cache size: 7, Positive unconditional cache size: 92, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 41 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 25, independent conditional: 25, 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: 47, independent: 25, independent conditional: 16, independent unconditional: 9, 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: 47, independent: 25, independent conditional: 12, independent unconditional: 13, 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: 47, independent: 25, independent conditional: 12, independent unconditional: 13, 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: 9, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 9, unknown conditional: 2, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 122, Positive conditional cache size: 9, Positive unconditional cache size: 113, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 37 PlacesBefore, 36 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 33, independent conditional: 30, independent unconditional: 3, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 30, independent unconditional: 3, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 28, independent conditional: 26, independent unconditional: 2, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 149, Positive conditional cache size: 13, Positive unconditional cache size: 136, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-3, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=-2, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=-1, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 836]: 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: 838]: 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: 834]: 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, 134 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: 10.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 656 IncrementalHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 7 mSDtfsCounter, 656 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 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-05 23:18:15,703 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...