/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 --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:23:44,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:23:44,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:23:44,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:23:44,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:23:44,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:23:44,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:23:44,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:23:44,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:23:44,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:23:44,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:23:44,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:23:44,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:23:44,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:23:44,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:23:44,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:23:44,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:23:44,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:23:44,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:23:44,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:23:44,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:23:44,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:23:44,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:23:44,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:23:44,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:23:44,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:23:44,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:23:44,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:23:44,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:23:44,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:23:44,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:23:44,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:23:44,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:23:44,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:23:44,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:23:44,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:23:44,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:23:44,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:23:44,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:23:44,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:23:44,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:23:44,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 06:23:44,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:23:44,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:23:44,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:23:44,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:23:44,760 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:23:44,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:23:44,760 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:23:44,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:23:44,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:23:44,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:23:44,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:23:44,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:23:44,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:23:44,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:23:44,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:23:44,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:23:44,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:23:44,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:23:44,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:23:44,763 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:23:45,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:23:45,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:23:45,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:23:45,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:23:45,100 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:23:45,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_tso.i [2022-12-13 06:23:46,218 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:23:46,470 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:23:46,470 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_tso.i [2022-12-13 06:23:46,502 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2728a3275/56d4ac7423154db0b6e7edd6945f70c7/FLAG2ddc30ddc [2022-12-13 06:23:46,515 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2728a3275/56d4ac7423154db0b6e7edd6945f70c7 [2022-12-13 06:23:46,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:23:46,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:23:46,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:23:46,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:23:46,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:23:46,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10606308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46, skipping insertion in model container [2022-12-13 06:23:46,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:23:46,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:23:46,656 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/safe011_tso.i[945,958] [2022-12-13 06:23:46,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:23:46,767 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:23:46,778 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_tso.i[945,958] [2022-12-13 06:23:46,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:23:46,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:23:46,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:23:46,858 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:23:46,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46 WrapperNode [2022-12-13 06:23:46,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:23:46,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:23:46,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:23:46,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:23:46,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,904 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-12-13 06:23:46,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:23:46,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:23:46,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:23:46,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:23:46,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:23:46,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:23:46,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:23:46,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:23:46,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (1/1) ... [2022-12-13 06:23:46,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:23:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:23:46,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 06:23:46,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 06:23:46,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:23:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:23:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:23:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:23:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:23:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:23:46,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:23:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:23:46,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:23:46,988 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 06:23:46,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 06:23:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:23:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:23:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:23:46,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:23:46,990 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:23:47,109 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:23:47,110 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:23:47,263 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:23:47,273 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:23:47,273 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:23:47,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:23:47 BoogieIcfgContainer [2022-12-13 06:23:47,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:23:47,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:23:47,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:23:47,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:23:47,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:23:46" (1/3) ... [2022-12-13 06:23:47,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16af82de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:23:47, skipping insertion in model container [2022-12-13 06:23:47,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:23:46" (2/3) ... [2022-12-13 06:23:47,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16af82de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:23:47, skipping insertion in model container [2022-12-13 06:23:47,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:23:47" (3/3) ... [2022-12-13 06:23:47,280 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_tso.i [2022-12-13 06:23:47,293 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:23:47,293 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 06:23:47,293 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:23:47,342 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:23:47,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 84 transitions, 183 flow [2022-12-13 06:23:47,410 INFO L130 PetriNetUnfolder]: 2/81 cut-off events. [2022-12-13 06:23:47,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:47,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 06:23:47,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 84 transitions, 183 flow [2022-12-13 06:23:47,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 69 transitions, 147 flow [2022-12-13 06:23:47,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:47,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-13 06:23:47,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 147 flow [2022-12-13 06:23:47,467 INFO L130 PetriNetUnfolder]: 1/69 cut-off events. [2022-12-13 06:23:47,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:47,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 06:23:47,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-13 06:23:47,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 06:23:49,220 INFO L241 LiptonReduction]: Total number of compositions: 52 [2022-12-13 06:23:49,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:23:49,273 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;@1d756570, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:23:49,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 06:23:49,280 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 06:23:49,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:23:49,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:49,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:49,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1924478164, now seen corresponding path program 1 times [2022-12-13 06:23:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:49,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512947381] [2022-12-13 06:23:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512947381] [2022-12-13 06:23:49,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512947381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:49,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:49,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:23:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87795483] [2022-12-13 06:23:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:49,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:23:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:23:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:23:49,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 06:23:49,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:49,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:49,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 06:23:49,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:49,939 INFO L130 PetriNetUnfolder]: 1006/1754 cut-off events. [2022-12-13 06:23:49,939 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 06:23:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3410 conditions, 1754 events. 1006/1754 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 10906 event pairs, 372 based on Foata normal form. 85/1453 useless extension candidates. Maximal degree in co-relation 3399. Up to 861 conditions per place. [2022-12-13 06:23:49,951 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 29 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2022-12-13 06:23:49,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 169 flow [2022-12-13 06:23:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 06:23:49,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2022-12-13 06:23:49,962 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 06:23:49,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 42 transitions, 169 flow [2022-12-13 06:23:49,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 42 transitions, 169 flow [2022-12-13 06:23:49,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:49,976 INFO L89 Accepts]: Start accepts. Operand has 38 places, 42 transitions, 169 flow [2022-12-13 06:23:49,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:49,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:49,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 42 transitions, 169 flow [2022-12-13 06:23:49,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 169 flow [2022-12-13 06:23:49,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-13 06:23:50,118 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:50,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 06:23:50,120 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 42 transitions, 169 flow [2022-12-13 06:23:50,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:50,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:50,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:50,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:23:50,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -470720355, now seen corresponding path program 1 times [2022-12-13 06:23:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:50,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537751030] [2022-12-13 06:23:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:50,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:50,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537751030] [2022-12-13 06:23:50,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537751030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:50,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:50,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892506393] [2022-12-13 06:23:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:50,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:50,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 06:23:50,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 42 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:50,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:50,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 06:23:50,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:50,460 INFO L130 PetriNetUnfolder]: 963/1728 cut-off events. [2022-12-13 06:23:50,461 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-13 06:23:50,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4844 conditions, 1728 events. 963/1728 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 11193 event pairs, 123 based on Foata normal form. 12/1359 useless extension candidates. Maximal degree in co-relation 4830. Up to 821 conditions per place. [2022-12-13 06:23:50,470 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 45 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2022-12-13 06:23:50,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 62 transitions, 368 flow [2022-12-13 06:23:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 06:23:50,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2022-12-13 06:23:50,473 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 06:23:50,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 62 transitions, 368 flow [2022-12-13 06:23:50,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 62 transitions, 368 flow [2022-12-13 06:23:50,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:50,487 INFO L89 Accepts]: Start accepts. Operand has 41 places, 62 transitions, 368 flow [2022-12-13 06:23:50,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:50,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:50,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 62 transitions, 368 flow [2022-12-13 06:23:50,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 62 transitions, 368 flow [2022-12-13 06:23:50,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 06:23:50,598 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:50,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 06:23:50,600 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 62 transitions, 372 flow [2022-12-13 06:23:50,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:50,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:50,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:50,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:23:50,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:50,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash -470719084, now seen corresponding path program 1 times [2022-12-13 06:23:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:50,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813934517] [2022-12-13 06:23:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813934517] [2022-12-13 06:23:50,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813934517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:50,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:50,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094220315] [2022-12-13 06:23:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:50,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:50,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2022-12-13 06:23:50,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 62 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:50,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:50,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2022-12-13 06:23:50,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:50,884 INFO L130 PetriNetUnfolder]: 851/1599 cut-off events. [2022-12-13 06:23:50,884 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-12-13 06:23:50,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 1599 events. 851/1599 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 10659 event pairs, 122 based on Foata normal form. 12/1238 useless extension candidates. Maximal degree in co-relation 5838. Up to 787 conditions per place. [2022-12-13 06:23:50,894 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 51 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-13 06:23:50,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 569 flow [2022-12-13 06:23:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 06:23:50,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2022-12-13 06:23:50,896 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 06:23:50,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 73 transitions, 569 flow [2022-12-13 06:23:50,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 73 transitions, 569 flow [2022-12-13 06:23:50,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:50,912 INFO L89 Accepts]: Start accepts. Operand has 44 places, 73 transitions, 569 flow [2022-12-13 06:23:50,913 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:50,913 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:50,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 73 transitions, 569 flow [2022-12-13 06:23:50,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 73 transitions, 569 flow [2022-12-13 06:23:50,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 06:23:51,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:23:51,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 06:23:51,001 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 73 transitions, 575 flow [2022-12-13 06:23:51,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:51,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:51,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:23:51,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1707429141, now seen corresponding path program 1 times [2022-12-13 06:23:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:51,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980319750] [2022-12-13 06:23:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:51,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:51,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980319750] [2022-12-13 06:23:51,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980319750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:51,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:51,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:23:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116588055] [2022-12-13 06:23:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:51,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:23:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:23:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:23:51,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2022-12-13 06:23:51,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 73 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:51,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2022-12-13 06:23:51,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:51,194 INFO L130 PetriNetUnfolder]: 792/1512 cut-off events. [2022-12-13 06:23:51,194 INFO L131 PetriNetUnfolder]: For 451/451 co-relation queries the response was YES. [2022-12-13 06:23:51,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6659 conditions, 1512 events. 792/1512 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 9980 event pairs, 36 based on Foata normal form. 24/1176 useless extension candidates. Maximal degree in co-relation 6639. Up to 898 conditions per place. [2022-12-13 06:23:51,203 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 63 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2022-12-13 06:23:51,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 85 transitions, 803 flow [2022-12-13 06:23:51,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:23:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:23:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-13 06:23:51,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-13 06:23:51,204 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-13 06:23:51,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 85 transitions, 803 flow [2022-12-13 06:23:51,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 85 transitions, 803 flow [2022-12-13 06:23:51,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:51,218 INFO L89 Accepts]: Start accepts. Operand has 46 places, 85 transitions, 803 flow [2022-12-13 06:23:51,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:51,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:51,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 85 transitions, 803 flow [2022-12-13 06:23:51,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 85 transitions, 803 flow [2022-12-13 06:23:51,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-13 06:23:51,234 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:51,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 06:23:51,237 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 85 transitions, 803 flow [2022-12-13 06:23:51,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:51,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:51,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:23:51,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1390764539, now seen corresponding path program 1 times [2022-12-13 06:23:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:51,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983794769] [2022-12-13 06:23:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:51,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983794769] [2022-12-13 06:23:51,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983794769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:51,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:51,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428778589] [2022-12-13 06:23:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:51,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:51,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:51,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 06:23:51,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 85 transitions, 803 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:51,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 06:23:51,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:51,463 INFO L130 PetriNetUnfolder]: 874/1663 cut-off events. [2022-12-13 06:23:51,463 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2022-12-13 06:23:51,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8954 conditions, 1663 events. 874/1663 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 11450 event pairs, 90 based on Foata normal form. 24/1241 useless extension candidates. Maximal degree in co-relation 8931. Up to 1052 conditions per place. [2022-12-13 06:23:51,478 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 67 selfloop transitions, 18 changer transitions 4/96 dead transitions. [2022-12-13 06:23:51,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 96 transitions, 1089 flow [2022-12-13 06:23:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 06:23:51,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7129629629629629 [2022-12-13 06:23:51,482 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 06:23:51,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 96 transitions, 1089 flow [2022-12-13 06:23:51,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 92 transitions, 1041 flow [2022-12-13 06:23:51,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:51,499 INFO L89 Accepts]: Start accepts. Operand has 49 places, 92 transitions, 1041 flow [2022-12-13 06:23:51,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:51,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:51,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 92 transitions, 1041 flow [2022-12-13 06:23:51,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 92 transitions, 1041 flow [2022-12-13 06:23:51,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 06:23:51,511 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:51,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 06:23:51,513 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 92 transitions, 1041 flow [2022-12-13 06:23:51,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:51,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:51,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:23:51,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1390697269, now seen corresponding path program 1 times [2022-12-13 06:23:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:51,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622308045] [2022-12-13 06:23:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:51,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:51,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622308045] [2022-12-13 06:23:51,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622308045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:51,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:51,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956829682] [2022-12-13 06:23:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:51,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:51,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:51,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 06:23:51,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 92 transitions, 1041 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:51,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 06:23:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:51,815 INFO L130 PetriNetUnfolder]: 1215/2276 cut-off events. [2022-12-13 06:23:51,816 INFO L131 PetriNetUnfolder]: For 3112/3112 co-relation queries the response was YES. [2022-12-13 06:23:51,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13413 conditions, 2276 events. 1215/2276 cut-off events. For 3112/3112 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 14936 event pairs, 30 based on Foata normal form. 32/1779 useless extension candidates. Maximal degree in co-relation 13387. Up to 1307 conditions per place. [2022-12-13 06:23:51,827 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 99 selfloop transitions, 27 changer transitions 22/154 dead transitions. [2022-12-13 06:23:51,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 154 transitions, 2050 flow [2022-12-13 06:23:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:23:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:23:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 06:23:51,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-13 06:23:51,829 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2022-12-13 06:23:51,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 154 transitions, 2050 flow [2022-12-13 06:23:51,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 132 transitions, 1751 flow [2022-12-13 06:23:51,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:51,858 INFO L89 Accepts]: Start accepts. Operand has 53 places, 132 transitions, 1751 flow [2022-12-13 06:23:51,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:51,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:51,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 132 transitions, 1751 flow [2022-12-13 06:23:51,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 132 transitions, 1751 flow [2022-12-13 06:23:51,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 06:23:51,865 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:51,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 06:23:51,865 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 132 transitions, 1751 flow [2022-12-13 06:23:51,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:51,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:51,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:23:51,866 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1390740049, now seen corresponding path program 2 times [2022-12-13 06:23:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:51,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496881617] [2022-12-13 06:23:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:51,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496881617] [2022-12-13 06:23:51,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496881617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:51,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:51,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702255918] [2022-12-13 06:23:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:51,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:23:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:51,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:23:51,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:23:51,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 06:23:51,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 132 transitions, 1751 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:51,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:51,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 06:23:51,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:52,104 INFO L130 PetriNetUnfolder]: 1129/2288 cut-off events. [2022-12-13 06:23:52,104 INFO L131 PetriNetUnfolder]: For 2971/2971 co-relation queries the response was YES. [2022-12-13 06:23:52,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15550 conditions, 2288 events. 1129/2288 cut-off events. For 2971/2971 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 16438 event pairs, 54 based on Foata normal form. 152/1831 useless extension candidates. Maximal degree in co-relation 15521. Up to 1367 conditions per place. [2022-12-13 06:23:52,112 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 64 selfloop transitions, 8 changer transitions 79/157 dead transitions. [2022-12-13 06:23:52,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 157 transitions, 2393 flow [2022-12-13 06:23:52,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:23:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:23:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-13 06:23:52,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2022-12-13 06:23:52,114 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-13 06:23:52,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 157 transitions, 2393 flow [2022-12-13 06:23:52,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 78 transitions, 1175 flow [2022-12-13 06:23:52,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:52,135 INFO L89 Accepts]: Start accepts. Operand has 57 places, 78 transitions, 1175 flow [2022-12-13 06:23:52,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:52,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:52,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 78 transitions, 1175 flow [2022-12-13 06:23:52,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 78 transitions, 1175 flow [2022-12-13 06:23:52,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 06:23:52,140 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:52,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:23:52,141 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 78 transitions, 1175 flow [2022-12-13 06:23:52,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:52,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:52,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:52,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:23:52,141 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -161961127, now seen corresponding path program 1 times [2022-12-13 06:23:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:52,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29528155] [2022-12-13 06:23:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:52,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29528155] [2022-12-13 06:23:52,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29528155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:52,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:52,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:52,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750239814] [2022-12-13 06:23:52,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:52,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:52,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:52,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 06:23:52,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 78 transitions, 1175 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:52,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:52,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 06:23:52,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:52,365 INFO L130 PetriNetUnfolder]: 947/1697 cut-off events. [2022-12-13 06:23:52,365 INFO L131 PetriNetUnfolder]: For 5315/5414 co-relation queries the response was YES. [2022-12-13 06:23:52,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 1697 events. 947/1697 cut-off events. For 5315/5414 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 10187 event pairs, 80 based on Foata normal form. 55/1305 useless extension candidates. Maximal degree in co-relation 12202. Up to 956 conditions per place. [2022-12-13 06:23:52,372 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 73 selfloop transitions, 28 changer transitions 81/192 dead transitions. [2022-12-13 06:23:52,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 192 transitions, 3252 flow [2022-12-13 06:23:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:23:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:23:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 06:23:52,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-13 06:23:52,373 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-13 06:23:52,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 192 transitions, 3252 flow [2022-12-13 06:23:52,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 111 transitions, 1878 flow [2022-12-13 06:23:52,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:52,389 INFO L89 Accepts]: Start accepts. Operand has 58 places, 111 transitions, 1878 flow [2022-12-13 06:23:52,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:52,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:52,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 111 transitions, 1878 flow [2022-12-13 06:23:52,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 111 transitions, 1878 flow [2022-12-13 06:23:52,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-13 06:23:52,394 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:52,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:23:52,394 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 111 transitions, 1878 flow [2022-12-13 06:23:52,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:52,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:52,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:52,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:23:52,395 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1242523506, now seen corresponding path program 1 times [2022-12-13 06:23:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:52,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510456179] [2022-12-13 06:23:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:52,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:52,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510456179] [2022-12-13 06:23:52,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510456179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:52,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:52,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:23:52,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329393971] [2022-12-13 06:23:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:52,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:23:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:23:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:23:52,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:23:52,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 111 transitions, 1878 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:52,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:52,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:23:52,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:52,563 INFO L130 PetriNetUnfolder]: 416/833 cut-off events. [2022-12-13 06:23:52,563 INFO L131 PetriNetUnfolder]: For 3735/3871 co-relation queries the response was YES. [2022-12-13 06:23:52,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6858 conditions, 833 events. 416/833 cut-off events. For 3735/3871 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4568 event pairs, 0 based on Foata normal form. 82/722 useless extension candidates. Maximal degree in co-relation 6823. Up to 688 conditions per place. [2022-12-13 06:23:52,567 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 52 selfloop transitions, 43 changer transitions 27/130 dead transitions. [2022-12-13 06:23:52,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 130 transitions, 2421 flow [2022-12-13 06:23:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:23:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:23:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 06:23:52,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 06:23:52,568 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-13 06:23:52,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 130 transitions, 2421 flow [2022-12-13 06:23:52,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 103 transitions, 1907 flow [2022-12-13 06:23:52,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:23:52,577 INFO L89 Accepts]: Start accepts. Operand has 61 places, 103 transitions, 1907 flow [2022-12-13 06:23:52,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:23:52,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:52,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 103 transitions, 1907 flow [2022-12-13 06:23:52,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 103 transitions, 1907 flow [2022-12-13 06:23:52,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 06:23:52,581 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:52,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:23:52,582 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 103 transitions, 1907 flow [2022-12-13 06:23:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:52,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:23:52,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:23:52,582 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 06:23:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:23:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1015433924, now seen corresponding path program 1 times [2022-12-13 06:23:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:23:52,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327347226] [2022-12-13 06:23:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:23:52,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:23:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:23:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:23:52,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:23:52,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327347226] [2022-12-13 06:23:52,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327347226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:23:52,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:23:52,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:23:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821341623] [2022-12-13 06:23:52,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:23:52,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:23:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:23:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:23:52,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:23:52,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:23:52,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 103 transitions, 1907 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:52,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:23:52,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:23:52,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:23:52,747 INFO L130 PetriNetUnfolder]: 214/478 cut-off events. [2022-12-13 06:23:52,747 INFO L131 PetriNetUnfolder]: For 3077/3178 co-relation queries the response was YES. [2022-12-13 06:23:52,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 478 events. 214/478 cut-off events. For 3077/3178 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2521 event pairs, 0 based on Foata normal form. 78/459 useless extension candidates. Maximal degree in co-relation 4286. Up to 397 conditions per place. [2022-12-13 06:23:52,748 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2022-12-13 06:23:52,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 2075 flow [2022-12-13 06:23:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:23:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:23:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 06:23:52,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 06:23:52,751 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2022-12-13 06:23:52,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 102 transitions, 2075 flow [2022-12-13 06:23:52,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 06:23:52,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:23:52,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:23:52,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 06:23:52,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 06:23:52,754 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:23:52,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 06:23:52,755 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 06:23:52,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:23:52,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 06:23:52,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 06:23:52,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 06:23:52,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 06:23:52,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:23:52,759 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:23:52,762 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:23:52,762 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:23:52,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:23:52 BasicIcfg [2022-12-13 06:23:52,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:23:52,764 INFO L158 Benchmark]: Toolchain (without parser) took 6246.12ms. Allocated memory was 241.2MB in the beginning and 506.5MB in the end (delta: 265.3MB). Free memory was 216.3MB in the beginning and 258.9MB in the end (delta: -42.6MB). Peak memory consumption was 223.2MB. Max. memory is 8.0GB. [2022-12-13 06:23:52,764 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 241.2MB. Free memory was 217.5MB in the beginning and 217.4MB in the end (delta: 88.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:23:52,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.03ms. Allocated memory is still 241.2MB. Free memory was 215.8MB in the beginning and 192.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 06:23:52,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.39ms. Allocated memory is still 241.2MB. Free memory was 192.7MB in the beginning and 191.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:23:52,764 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 241.2MB. Free memory was 191.1MB in the beginning and 189.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 06:23:52,765 INFO L158 Benchmark]: RCFGBuilder took 342.28ms. Allocated memory is still 241.2MB. Free memory was 189.6MB in the beginning and 175.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 06:23:52,765 INFO L158 Benchmark]: TraceAbstraction took 5486.95ms. Allocated memory was 241.2MB in the beginning and 506.5MB in the end (delta: 265.3MB). Free memory was 174.9MB in the beginning and 258.9MB in the end (delta: -84.0MB). Peak memory consumption was 182.3MB. Max. memory is 8.0GB. [2022-12-13 06:23:52,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 241.2MB. Free memory was 217.5MB in the beginning and 217.4MB in the end (delta: 88.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 339.03ms. Allocated memory is still 241.2MB. Free memory was 215.8MB in the beginning and 192.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.39ms. Allocated memory is still 241.2MB. Free memory was 192.7MB in the beginning and 191.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 241.2MB. Free memory was 191.1MB in the beginning and 189.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 342.28ms. Allocated memory is still 241.2MB. Free memory was 189.6MB in the beginning and 175.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5486.95ms. Allocated memory was 241.2MB in the beginning and 506.5MB in the end (delta: 265.3MB). Free memory was 174.9MB in the beginning and 258.9MB in the end (delta: -84.0MB). Peak memory consumption was 182.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 78 PlacesBefore, 36 PlacesAfterwards, 69 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1242, independent: 1186, independent conditional: 1186, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1242, independent: 1186, independent conditional: 0, independent unconditional: 1186, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1242, independent: 1186, independent conditional: 0, independent unconditional: 1186, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1242, independent: 1186, independent conditional: 0, independent unconditional: 1186, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 888, independent: 852, independent conditional: 0, independent unconditional: 852, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 888, independent: 824, independent conditional: 0, independent unconditional: 824, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1242, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 888, unknown conditional: 0, unknown unconditional: 888] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1283, Positive conditional cache size: 0, Positive unconditional cache size: 1283, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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, 38 PlacesBefore, 38 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 155, independent conditional: 155, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 155, independent conditional: 62, independent unconditional: 93, dependent: 13, dependent conditional: 12, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 31, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 74, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 191, independent conditional: 56, independent unconditional: 135, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 207, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 207, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 207, independent: 182, independent conditional: 0, independent unconditional: 182, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 451, independent conditional: 451, 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: 471, independent: 451, independent conditional: 224, independent unconditional: 227, dependent: 20, dependent conditional: 18, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 471, independent: 451, independent conditional: 0, independent unconditional: 451, 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: 471, independent: 451, independent conditional: 0, independent unconditional: 451, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 471, independent: 445, independent conditional: 0, independent unconditional: 445, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 242, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 449, independent: 432, independent conditional: 432, 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: 449, independent: 432, independent conditional: 240, independent unconditional: 192, dependent: 17, dependent conditional: 16, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 465, independent: 432, independent conditional: 0, independent unconditional: 432, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 465, independent: 432, independent conditional: 0, independent unconditional: 432, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 465, independent: 427, independent conditional: 0, independent unconditional: 427, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 272, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 565, independent: 548, independent conditional: 548, 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: 565, independent: 548, independent conditional: 355, independent unconditional: 193, dependent: 17, dependent conditional: 16, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 581, independent: 548, independent conditional: 0, independent unconditional: 548, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 581, independent: 548, independent conditional: 0, independent unconditional: 548, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 581, independent: 547, independent conditional: 0, independent unconditional: 547, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 387, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 107 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 536 IncrementalHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 21 mSDtfsCounter, 536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1907occurred in iteration=9, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 401 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 06:23:52,815 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...