/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:54:24,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:54:24,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:54:24,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:54:24,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:54:24,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:54:24,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:54:24,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:54:24,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:54:24,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:54:24,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:54:24,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:54:24,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:54:24,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:54:24,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:54:24,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:54:24,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:54:24,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:54:24,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:54:24,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:54:24,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:54:24,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:54:24,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:54:24,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:54:24,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:54:24,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:54:24,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:54:24,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:54:24,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:54:24,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:54:24,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:54:24,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:54:24,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:54:24,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:54:24,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:54:24,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:54:24,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:54:24,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:54:24,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:54:24,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:54:24,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:54:24,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:54:24,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:54:24,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:54:24,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:54:24,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:54:24,728 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:54:24,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:54:24,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:54:24,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:54:24,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:54:24,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:54:24,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:54:24,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:54:24,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:54:24,730 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:54:24,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:54:24,730 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:54:24,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:54:24,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:54:24,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:54:24,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:54:24,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:54:24,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:54:24,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:54:24,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:54:24,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:54:24,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:54:24,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:54:24,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:54:24,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:54:25,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:54:25,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:54:25,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:54:25,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:54:25,130 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:54:25,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2022-12-05 22:54:26,077 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:54:26,291 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:54:26,296 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2022-12-05 22:54:26,310 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20f4e9ce/db2b69706c794e5093fdd1b90f5bba15/FLAGe4e56c2be [2022-12-05 22:54:26,322 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20f4e9ce/db2b69706c794e5093fdd1b90f5bba15 [2022-12-05 22:54:26,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:54:26,324 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:54:26,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:54:26,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:54:26,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:54:26,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5befdf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26, skipping insertion in model container [2022-12-05 22:54:26,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:54:26,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:54:26,491 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/mix010.opt.i[944,957] [2022-12-05 22:54:26,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:54:26,705 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:54:26,717 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/mix010.opt.i[944,957] [2022-12-05 22:54:26,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:26,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:26,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:54:26,799 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:54:26,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26 WrapperNode [2022-12-05 22:54:26,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:54:26,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:54:26,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:54:26,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:54:26,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,837 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-05 22:54:26,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:54:26,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:54:26,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:54:26,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:54:26,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:54:26,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:54:26,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:54:26,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:54:26,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (1/1) ... [2022-12-05 22:54:26,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:54:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:54:26,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 22:54:26,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 22:54:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:54:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:54:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:54:26,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:54:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:54:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:54:26,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:54:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:54:26,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:54:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:54:26,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:54:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:54:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:54:26,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:54:26,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:54:26,981 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:54:27,142 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:54:27,143 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:54:27,362 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:54:27,455 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:54:27,455 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:54:27,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:54:27 BoogieIcfgContainer [2022-12-05 22:54:27,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:54:27,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:54:27,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:54:27,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:54:27,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:54:26" (1/3) ... [2022-12-05 22:54:27,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548eae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:54:27, skipping insertion in model container [2022-12-05 22:54:27,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:26" (2/3) ... [2022-12-05 22:54:27,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548eae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:54:27, skipping insertion in model container [2022-12-05 22:54:27,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:54:27" (3/3) ... [2022-12-05 22:54:27,461 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2022-12-05 22:54:27,473 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:54:27,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:54:27,473 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:54:27,528 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:54:27,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-05 22:54:27,609 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-05 22:54:27,609 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:27,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 22:54:27,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-05 22:54:27,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-05 22:54:27,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:27,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-05 22:54:27,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-05 22:54:27,682 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-05 22:54:27,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:27,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 22:54:27,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-05 22:54:27,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-05 22:54:31,361 INFO L203 LiptonReduction]: Total number of compositions: 87 [2022-12-05 22:54:31,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:54:31,375 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;@7e95a4df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:54:31,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 22:54:31,378 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 22:54:31,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:31,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:31,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:31,379 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -71215509, now seen corresponding path program 1 times [2022-12-05 22:54:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:31,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339441454] [2022-12-05 22:54:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:31,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:31,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339441454] [2022-12-05 22:54:31,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339441454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:31,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:31,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:54:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102066423] [2022-12-05 22:54:31,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:31,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:31,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 22:54:31,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:31,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:31,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 22:54:31,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:31,941 INFO L130 PetriNetUnfolder]: 994/1573 cut-off events. [2022-12-05 22:54:31,941 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 22:54:31,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1573 events. 994/1573 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7717 event pairs, 166 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 3086. Up to 1189 conditions per place. [2022-12-05 22:54:31,949 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 26 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2022-12-05 22:54:31,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 141 flow [2022-12-05 22:54:31,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 22:54:31,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-05 22:54:31,958 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 43 transitions. [2022-12-05 22:54:31,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 141 flow [2022-12-05 22:54:31,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:54:31,961 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-05 22:54:31,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-05 22:54:31,964 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 22:54:31,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:31,965 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 52 flow [2022-12-05 22:54:31,967 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:31,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:31,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 52 flow [2022-12-05 22:54:31,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-05 22:54:31,972 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 22:54:31,972 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:31,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:54:31,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-05 22:54:31,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-05 22:54:32,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:54:32,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-05 22:54:32,088 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 22:54:32,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:32,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:32,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:54:32,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:32,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 281431725, now seen corresponding path program 1 times [2022-12-05 22:54:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:32,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790077425] [2022-12-05 22:54:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:32,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790077425] [2022-12-05 22:54:32,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790077425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:32,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:32,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:54:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553040072] [2022-12-05 22:54:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:32,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:32,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:54:32,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:32,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:54:32,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:32,405 INFO L130 PetriNetUnfolder]: 843/1264 cut-off events. [2022-12-05 22:54:32,405 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-05 22:54:32,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 1264 events. 843/1264 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4921 event pairs, 351 based on Foata normal form. 4/1268 useless extension candidates. Maximal degree in co-relation 2626. Up to 1231 conditions per place. [2022-12-05 22:54:32,410 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 27 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2022-12-05 22:54:32,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 140 flow [2022-12-05 22:54:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-05 22:54:32,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 22:54:32,411 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 32 transitions. [2022-12-05 22:54:32,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 140 flow [2022-12-05 22:54:32,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:54:32,413 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 72 flow [2022-12-05 22:54:32,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-05 22:54:32,414 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-05 22:54:32,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:32,414 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 72 flow [2022-12-05 22:54:32,414 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:32,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:32,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 72 flow [2022-12-05 22:54:32,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 72 flow [2022-12-05 22:54:32,421 INFO L130 PetriNetUnfolder]: 14/65 cut-off events. [2022-12-05 22:54:32,421 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:32,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 65 events. 14/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 201 event pairs, 6 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 98. Up to 29 conditions per place. [2022-12-05 22:54:32,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 72 flow [2022-12-05 22:54:32,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-05 22:54:32,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:32,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-05 22:54:32,438 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 72 flow [2022-12-05 22:54:32,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:32,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:32,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:54:32,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:32,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash 134450144, now seen corresponding path program 1 times [2022-12-05 22:54:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:32,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997435175] [2022-12-05 22:54:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:32,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:32,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997435175] [2022-12-05 22:54:32,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997435175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:32,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:32,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920030039] [2022-12-05 22:54:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:32,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:32,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:54:32,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 72 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:32,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:54:32,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:32,714 INFO L130 PetriNetUnfolder]: 775/1168 cut-off events. [2022-12-05 22:54:32,714 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-05 22:54:32,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 1168 events. 775/1168 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4329 event pairs, 239 based on Foata normal form. 28/1196 useless extension candidates. Maximal degree in co-relation 2710. Up to 817 conditions per place. [2022-12-05 22:54:32,718 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-05 22:54:32,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 154 flow [2022-12-05 22:54:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-05 22:54:32,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-05 22:54:32,719 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 72 flow. Second operand 3 states and 29 transitions. [2022-12-05 22:54:32,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 154 flow [2022-12-05 22:54:32,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:32,720 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 79 flow [2022-12-05 22:54:32,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2022-12-05 22:54:32,720 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 22:54:32,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:32,721 INFO L89 Accepts]: Start accepts. Operand has 32 places, 23 transitions, 79 flow [2022-12-05 22:54:32,721 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:32,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:32,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 79 flow [2022-12-05 22:54:32,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 79 flow [2022-12-05 22:54:32,726 INFO L130 PetriNetUnfolder]: 9/46 cut-off events. [2022-12-05 22:54:32,726 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-05 22:54:32,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 46 events. 9/46 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 2 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 80. Up to 21 conditions per place. [2022-12-05 22:54:32,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 79 flow [2022-12-05 22:54:32,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-05 22:54:32,727 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:32,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:54:32,728 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 79 flow [2022-12-05 22:54:32,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:32,728 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:32,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:54:32,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash -168706292, now seen corresponding path program 1 times [2022-12-05 22:54:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:32,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383982873] [2022-12-05 22:54:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:32,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:32,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383982873] [2022-12-05 22:54:32,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383982873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:32,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:32,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:54:32,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80710867] [2022-12-05 22:54:32,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:32,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:54:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:32,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:54:32,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:54:32,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:54:32,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 79 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:32,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:32,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:54:32,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:33,064 INFO L130 PetriNetUnfolder]: 735/1112 cut-off events. [2022-12-05 22:54:33,064 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-12-05 22:54:33,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 1112 events. 735/1112 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4343 event pairs, 196 based on Foata normal form. 16/1128 useless extension candidates. Maximal degree in co-relation 2674. Up to 921 conditions per place. [2022-12-05 22:54:33,068 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 34 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2022-12-05 22:54:33,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 216 flow [2022-12-05 22:54:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-05 22:54:33,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-05 22:54:33,069 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 79 flow. Second operand 4 states and 39 transitions. [2022-12-05 22:54:33,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 216 flow [2022-12-05 22:54:33,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:54:33,071 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 121 flow [2022-12-05 22:54:33,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-05 22:54:33,071 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-05 22:54:33,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:33,072 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 121 flow [2022-12-05 22:54:33,072 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:33,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:33,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 121 flow [2022-12-05 22:54:33,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 121 flow [2022-12-05 22:54:33,077 INFO L130 PetriNetUnfolder]: 8/45 cut-off events. [2022-12-05 22:54:33,077 INFO L131 PetriNetUnfolder]: For 10/17 co-relation queries the response was YES. [2022-12-05 22:54:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 45 events. 8/45 cut-off events. For 10/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 94. Up to 18 conditions per place. [2022-12-05 22:54:33,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 121 flow [2022-12-05 22:54:33,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 22:54:33,088 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:33,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 22:54:33,089 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 121 flow [2022-12-05 22:54:33,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:33,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:33,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:33,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:54:33,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash 357545655, now seen corresponding path program 1 times [2022-12-05 22:54:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829182108] [2022-12-05 22:54:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:33,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:33,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829182108] [2022-12-05 22:54:33,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829182108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:33,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:33,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:33,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848531845] [2022-12-05 22:54:33,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:33,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:33,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:33,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:33,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:33,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 22:54:33,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:33,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:33,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 22:54:33,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:33,315 INFO L130 PetriNetUnfolder]: 309/545 cut-off events. [2022-12-05 22:54:33,315 INFO L131 PetriNetUnfolder]: For 310/311 co-relation queries the response was YES. [2022-12-05 22:54:33,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 545 events. 309/545 cut-off events. For 310/311 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2204 event pairs, 74 based on Foata normal form. 34/577 useless extension candidates. Maximal degree in co-relation 1449. Up to 424 conditions per place. [2022-12-05 22:54:33,318 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 36 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2022-12-05 22:54:33,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 265 flow [2022-12-05 22:54:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 22:54:33,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-05 22:54:33,319 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 121 flow. Second operand 3 states and 38 transitions. [2022-12-05 22:54:33,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 265 flow [2022-12-05 22:54:33,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:33,321 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 142 flow [2022-12-05 22:54:33,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-05 22:54:33,321 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-05 22:54:33,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:33,322 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 142 flow [2022-12-05 22:54:33,322 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:33,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:33,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 142 flow [2022-12-05 22:54:33,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 142 flow [2022-12-05 22:54:33,330 INFO L130 PetriNetUnfolder]: 29/102 cut-off events. [2022-12-05 22:54:33,330 INFO L131 PetriNetUnfolder]: For 34/43 co-relation queries the response was YES. [2022-12-05 22:54:33,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 102 events. 29/102 cut-off events. For 34/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 403 event pairs, 8 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 219. Up to 48 conditions per place. [2022-12-05 22:54:33,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 142 flow [2022-12-05 22:54:33,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-05 22:54:33,332 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:33,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 22:54:33,333 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 142 flow [2022-12-05 22:54:33,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:33,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:33,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:33,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:54:33,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2033204724, now seen corresponding path program 1 times [2022-12-05 22:54:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:33,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978192670] [2022-12-05 22:54:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:33,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978192670] [2022-12-05 22:54:33,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978192670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:33,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:33,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:54:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491826569] [2022-12-05 22:54:33,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:33,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:33,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:33,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:33,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 22:54:33,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:33,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:33,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 22:54:33,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:33,581 INFO L130 PetriNetUnfolder]: 159/313 cut-off events. [2022-12-05 22:54:33,581 INFO L131 PetriNetUnfolder]: For 185/186 co-relation queries the response was YES. [2022-12-05 22:54:33,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 313 events. 159/313 cut-off events. For 185/186 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1153 event pairs, 43 based on Foata normal form. 33/344 useless extension candidates. Maximal degree in co-relation 954. Up to 106 conditions per place. [2022-12-05 22:54:33,583 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 44 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2022-12-05 22:54:33,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 341 flow [2022-12-05 22:54:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 22:54:33,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-05 22:54:33,584 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 142 flow. Second operand 4 states and 51 transitions. [2022-12-05 22:54:33,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 341 flow [2022-12-05 22:54:33,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:33,586 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 178 flow [2022-12-05 22:54:33,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-05 22:54:33,587 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-05 22:54:33,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:33,587 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 178 flow [2022-12-05 22:54:33,588 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:33,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:33,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 178 flow [2022-12-05 22:54:33,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 178 flow [2022-12-05 22:54:33,594 INFO L130 PetriNetUnfolder]: 18/72 cut-off events. [2022-12-05 22:54:33,594 INFO L131 PetriNetUnfolder]: For 46/52 co-relation queries the response was YES. [2022-12-05 22:54:33,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 72 events. 18/72 cut-off events. For 46/52 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 205 event pairs, 1 based on Foata normal form. 5/77 useless extension candidates. Maximal degree in co-relation 189. Up to 30 conditions per place. [2022-12-05 22:54:33,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 178 flow [2022-12-05 22:54:33,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 22:54:33,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] $Ultimate##0-->L810: Formula: (and (= v_~z$r_buff0_thd3~0_84 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0_used~0_152 v_~z$w_buff1_used~0_136) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_136 256) 0)) (not (= (mod v_~z$w_buff0_used~0_151 256) 0)))) 1 0)) (= v_~z$r_buff0_thd2~0_51 v_~z$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~z$w_buff0~0_88 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~z$w_buff0~0_89 v_~z$w_buff1~0_77) (= v_~z$r_buff0_thd1~0_13 v_~z$r_buff1_thd1~0_15) (= v_~z$w_buff0_used~0_151 1) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_71) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_31 v_~z$r_buff1_thd0~0_31)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_152, ~z$w_buff0~0=v_~z$w_buff0~0_89, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_151, ~z$w_buff0~0=v_~z$w_buff0~0_88, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_71, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_136, ~z$w_buff1~0=v_~z$w_buff1~0_77, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_31, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_84, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork1_~arg#1.offset, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$r_buff1_thd0~0, P2Thread1of1ForFork1_~arg#1.base, ~z$r_buff1_thd1~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [481] $Ultimate##0-->L773: Formula: (and (= v_~y~0_34 1) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_15) (= v_~x~0_40 1) (= v_~y~0_34 v_~__unbuffered_p1_EAX~0_86) (= v_P1Thread1of1ForFork0_~arg.base_15 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_86, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_40} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~y~0, ~x~0] [2022-12-05 22:54:34,242 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] $Ultimate##0-->L810: Formula: (and (= v_~z$r_buff0_thd3~0_84 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0_used~0_152 v_~z$w_buff1_used~0_136) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_136 256) 0)) (not (= (mod v_~z$w_buff0_used~0_151 256) 0)))) 1 0)) (= v_~z$r_buff0_thd2~0_51 v_~z$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~z$w_buff0~0_88 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~z$w_buff0~0_89 v_~z$w_buff1~0_77) (= v_~z$r_buff0_thd1~0_13 v_~z$r_buff1_thd1~0_15) (= v_~z$w_buff0_used~0_151 1) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_71) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_31 v_~z$r_buff1_thd0~0_31)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_152, ~z$w_buff0~0=v_~z$w_buff0~0_89, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_151, ~z$w_buff0~0=v_~z$w_buff0~0_88, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_71, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_136, ~z$w_buff1~0=v_~z$w_buff1~0_77, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_31, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_84, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork1_~arg#1.offset, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$r_buff1_thd0~0, P2Thread1of1ForFork1_~arg#1.base, ~z$r_buff1_thd1~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [481] $Ultimate##0-->L773: Formula: (and (= v_~y~0_34 1) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_15) (= v_~x~0_40 1) (= v_~y~0_34 v_~__unbuffered_p1_EAX~0_86) (= v_P1Thread1of1ForFork0_~arg.base_15 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_86, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_40} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~y~0, ~x~0] [2022-12-05 22:54:34,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:54:34,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 776 [2022-12-05 22:54:34,364 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 180 flow [2022-12-05 22:54:34,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:34,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:34,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:34,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:54:34,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1869586704, now seen corresponding path program 1 times [2022-12-05 22:54:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:34,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848494139] [2022-12-05 22:54:34,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:34,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:34,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848494139] [2022-12-05 22:54:34,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848494139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:34,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:34,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:54:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268593291] [2022-12-05 22:54:34,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:34,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:54:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:34,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:54:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:54:34,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-05 22:54:34,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:34,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:34,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-05 22:54:34,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:34,580 INFO L130 PetriNetUnfolder]: 133/253 cut-off events. [2022-12-05 22:54:34,580 INFO L131 PetriNetUnfolder]: For 360/361 co-relation queries the response was YES. [2022-12-05 22:54:34,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 253 events. 133/253 cut-off events. For 360/361 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 921 event pairs, 36 based on Foata normal form. 10/259 useless extension candidates. Maximal degree in co-relation 838. Up to 104 conditions per place. [2022-12-05 22:54:34,582 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 39 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2022-12-05 22:54:34,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 361 flow [2022-12-05 22:54:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:54:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:54:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-05 22:54:34,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-05 22:54:34,583 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 180 flow. Second operand 5 states and 59 transitions. [2022-12-05 22:54:34,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 361 flow [2022-12-05 22:54:34,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 314 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-05 22:54:34,584 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 172 flow [2022-12-05 22:54:34,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-05 22:54:34,585 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-05 22:54:34,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:34,585 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 172 flow [2022-12-05 22:54:34,586 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:34,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:34,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 172 flow [2022-12-05 22:54:34,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 172 flow [2022-12-05 22:54:34,592 INFO L130 PetriNetUnfolder]: 16/61 cut-off events. [2022-12-05 22:54:34,592 INFO L131 PetriNetUnfolder]: For 60/63 co-relation queries the response was YES. [2022-12-05 22:54:34,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 61 events. 16/61 cut-off events. For 60/63 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 165 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2022-12-05 22:54:34,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 172 flow [2022-12-05 22:54:34,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-05 22:54:34,860 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:54:34,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-05 22:54:34,861 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 168 flow [2022-12-05 22:54:34,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:34,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:34,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:34,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:54:34,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:34,862 INFO L85 PathProgramCache]: Analyzing trace with hash 48715940, now seen corresponding path program 1 times [2022-12-05 22:54:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:34,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558226557] [2022-12-05 22:54:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558226557] [2022-12-05 22:54:35,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558226557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:35,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:35,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:54:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226518227] [2022-12-05 22:54:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:35,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:35,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:35,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:35,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-05 22:54:35,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:35,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:35,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-05 22:54:35,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:35,110 INFO L130 PetriNetUnfolder]: 189/358 cut-off events. [2022-12-05 22:54:35,111 INFO L131 PetriNetUnfolder]: For 596/596 co-relation queries the response was YES. [2022-12-05 22:54:35,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 358 events. 189/358 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1441 event pairs, 30 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1156. Up to 196 conditions per place. [2022-12-05 22:54:35,112 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 32 selfloop transitions, 1 changer transitions 25/59 dead transitions. [2022-12-05 22:54:35,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 444 flow [2022-12-05 22:54:35,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-05 22:54:35,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-05 22:54:35,113 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 168 flow. Second operand 4 states and 46 transitions. [2022-12-05 22:54:35,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 59 transitions, 444 flow [2022-12-05 22:54:35,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 388 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 22:54:35,115 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 131 flow [2022-12-05 22:54:35,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-05 22:54:35,116 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-05 22:54:35,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:35,116 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 131 flow [2022-12-05 22:54:35,117 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:35,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:35,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 131 flow [2022-12-05 22:54:35,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 131 flow [2022-12-05 22:54:35,122 INFO L130 PetriNetUnfolder]: 14/57 cut-off events. [2022-12-05 22:54:35,122 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-05 22:54:35,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 57 events. 14/57 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 181 event pairs, 2 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 140. Up to 16 conditions per place. [2022-12-05 22:54:35,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 131 flow [2022-12-05 22:54:35,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-05 22:54:35,305 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:54:35,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-05 22:54:35,306 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 131 flow [2022-12-05 22:54:35,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:35,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:35,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:35,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:54:35,307 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:35,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1207091216, now seen corresponding path program 1 times [2022-12-05 22:54:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:35,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344494250] [2022-12-05 22:54:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:35,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344494250] [2022-12-05 22:54:35,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344494250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:35,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:35,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:54:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591725790] [2022-12-05 22:54:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:35,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:35,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 22:54:35,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:35,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:35,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 22:54:35,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:35,491 INFO L130 PetriNetUnfolder]: 113/219 cut-off events. [2022-12-05 22:54:35,491 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-12-05 22:54:35,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 219 events. 113/219 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 836 event pairs, 5 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 726. Up to 116 conditions per place. [2022-12-05 22:54:35,492 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 25 selfloop transitions, 1 changer transitions 23/49 dead transitions. [2022-12-05 22:54:35,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 332 flow [2022-12-05 22:54:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:54:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:54:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-05 22:54:35,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 22:54:35,493 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 131 flow. Second operand 4 states and 38 transitions. [2022-12-05 22:54:35,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 332 flow [2022-12-05 22:54:35,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 322 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 22:54:35,494 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 105 flow [2022-12-05 22:54:35,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2022-12-05 22:54:35,495 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-05 22:54:35,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:35,495 INFO L89 Accepts]: Start accepts. Operand has 40 places, 21 transitions, 105 flow [2022-12-05 22:54:35,495 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:35,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:35,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 21 transitions, 105 flow [2022-12-05 22:54:35,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 105 flow [2022-12-05 22:54:35,499 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-05 22:54:35,499 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-05 22:54:35,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 29 events. 6/29 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 73. Up to 10 conditions per place. [2022-12-05 22:54:35,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 21 transitions, 105 flow [2022-12-05 22:54:35,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-05 22:54:35,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:54:35,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-05 22:54:35,779 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 103 flow [2022-12-05 22:54:35,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:35,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:35,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:35,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:54:35,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash 572455438, now seen corresponding path program 1 times [2022-12-05 22:54:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:35,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631772999] [2022-12-05 22:54:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:54:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:36,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631772999] [2022-12-05 22:54:36,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631772999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:36,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:36,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:54:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770131855] [2022-12-05 22:54:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:36,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:54:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:54:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:54:36,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:54:36,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 103 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:36,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:36,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:54:36,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:36,415 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2022-12-05 22:54:36,415 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-05 22:54:36,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 72 events. 26/72 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 220 event pairs, 3 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 267. Up to 32 conditions per place. [2022-12-05 22:54:36,416 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 18 selfloop transitions, 3 changer transitions 16/37 dead transitions. [2022-12-05 22:54:36,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 273 flow [2022-12-05 22:54:36,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:54:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:54:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-12-05 22:54:36,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-05 22:54:36,417 INFO L175 Difference]: Start difference. First operand has 36 places, 20 transitions, 103 flow. Second operand 6 states and 24 transitions. [2022-12-05 22:54:36,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 273 flow [2022-12-05 22:54:36,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 262 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-05 22:54:36,418 INFO L231 Difference]: Finished difference. Result has 38 places, 20 transitions, 107 flow [2022-12-05 22:54:36,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=38, PETRI_TRANSITIONS=20} [2022-12-05 22:54:36,418 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-05 22:54:36,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:36,419 INFO L89 Accepts]: Start accepts. Operand has 38 places, 20 transitions, 107 flow [2022-12-05 22:54:36,419 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:36,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:36,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 20 transitions, 107 flow [2022-12-05 22:54:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 20 transitions, 107 flow [2022-12-05 22:54:36,423 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-05 22:54:36,423 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 22:54:36,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 29 events. 6/29 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 80. Up to 10 conditions per place. [2022-12-05 22:54:36,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 20 transitions, 107 flow [2022-12-05 22:54:36,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-05 22:54:36,887 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:54:36,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 469 [2022-12-05 22:54:36,888 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 121 flow [2022-12-05 22:54:36,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:54:36,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:36,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:36,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:54:36,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:54:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1121740730, now seen corresponding path program 1 times [2022-12-05 22:54:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:36,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211863312] [2022-12-05 22:54:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:54:36,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:54:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:54:36,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:54:36,946 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:54:36,947 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 22:54:36,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 22:54:36,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 22:54:36,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 22:54:36,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 22:54:36,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 22:54:36,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:54:36,948 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:36,952 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:54:36,952 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:54:36,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:54:36 BasicIcfg [2022-12-05 22:54:36,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:54:36,983 INFO L158 Benchmark]: Toolchain (without parser) took 10658.35ms. Allocated memory was 184.5MB in the beginning and 418.4MB in the end (delta: 233.8MB). Free memory was 159.4MB in the beginning and 169.3MB in the end (delta: -9.9MB). Peak memory consumption was 224.4MB. Max. memory is 8.0GB. [2022-12-05 22:54:36,983 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:54:36,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.10ms. Allocated memory is still 184.5MB. Free memory was 158.8MB in the beginning and 131.0MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:54:36,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:54:36,983 INFO L158 Benchmark]: Boogie Preprocessor took 23.11ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 125.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:54:36,983 INFO L158 Benchmark]: RCFGBuilder took 595.25ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 90.1MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-05 22:54:36,983 INFO L158 Benchmark]: TraceAbstraction took 9524.50ms. Allocated memory was 184.5MB in the beginning and 418.4MB in the end (delta: 233.8MB). Free memory was 89.6MB in the beginning and 169.3MB in the end (delta: -79.6MB). Peak memory consumption was 155.2MB. Max. memory is 8.0GB. [2022-12-05 22:54:36,984 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.10ms. Allocated memory is still 184.5MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.10ms. Allocated memory is still 184.5MB. Free memory was 158.8MB in the beginning and 131.0MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.11ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 125.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.25ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 90.1MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9524.50ms. Allocated memory was 184.5MB in the beginning and 418.4MB in the end (delta: 233.8MB). Free memory was 89.6MB in the beginning and 169.3MB in the end (delta: -79.6MB). Peak memory consumption was 155.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 118 PlacesBefore, 35 PlacesAfterwards, 110 TransitionsBefore, 26 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1611, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1611, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1611, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1611, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1263, independent: 1223, independent conditional: 0, independent unconditional: 1223, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1263, independent: 1217, independent conditional: 0, independent unconditional: 1217, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 139, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1611, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1263, unknown conditional: 0, unknown unconditional: 1263] , Statistics on independence cache: Total cache size (in pairs): 1995, Positive cache size: 1955, Positive conditional cache size: 0, Positive unconditional cache size: 1955, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 195, independent: 154, independent conditional: 10, independent unconditional: 144, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, independent: 154, independent conditional: 10, independent unconditional: 144, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 195, independent: 154, independent conditional: 10, independent unconditional: 144, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 112, independent: 91, independent conditional: 7, independent unconditional: 84, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 112, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 87, dependent conditional: 17, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, independent: 63, independent conditional: 3, independent unconditional: 60, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 112, unknown conditional: 10, unknown unconditional: 102] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 95, Positive conditional cache size: 7, Positive unconditional cache size: 88, Negative cache size: 21, Negative conditional cache size: 3, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 77, independent conditional: 77, 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: 92, independent: 77, independent conditional: 10, independent unconditional: 67, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 102, Positive conditional cache size: 7, Positive unconditional cache size: 95, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 74, independent conditional: 12, independent unconditional: 62, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 104, Positive conditional cache size: 7, Positive unconditional cache size: 97, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 121, independent: 100, independent conditional: 33, independent unconditional: 67, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, independent: 100, independent conditional: 18, independent unconditional: 82, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, independent: 100, independent conditional: 18, independent unconditional: 82, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, independent: 94, independent conditional: 16, independent unconditional: 78, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 110, Positive conditional cache size: 9, Positive unconditional cache size: 101, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 86, independent conditional: 86, 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: 103, independent: 86, independent conditional: 39, independent unconditional: 47, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 86, independent conditional: 30, independent unconditional: 56, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 86, independent conditional: 30, independent unconditional: 56, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 79, independent conditional: 27, independent unconditional: 52, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 117, Positive conditional cache size: 12, Positive unconditional cache size: 105, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 40 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 165, independent: 130, independent conditional: 75, independent unconditional: 55, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 130, independent conditional: 57, independent unconditional: 73, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 130, independent conditional: 57, independent unconditional: 73, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 122, independent conditional: 52, independent unconditional: 70, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 131, Positive conditional cache size: 17, Positive unconditional cache size: 114, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 40 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 100, independent conditional: 64, independent unconditional: 36, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 100, independent conditional: 44, independent unconditional: 56, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 100, independent conditional: 44, independent unconditional: 56, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 128, independent: 99, independent conditional: 43, independent unconditional: 56, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 137, Positive conditional cache size: 18, Positive unconditional cache size: 119, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 98, independent conditional: 70, independent unconditional: 28, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 98, independent conditional: 66, independent unconditional: 32, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 98, independent conditional: 66, independent unconditional: 32, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 124, independent: 93, independent conditional: 63, independent unconditional: 30, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 159, Positive conditional cache size: 23, Positive unconditional cache size: 136, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 17, independent conditional: 16, independent unconditional: 1, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 17, independent conditional: 16, independent unconditional: 1, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 17, independent conditional: 16, independent unconditional: 1, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 17, independent conditional: 16, independent unconditional: 1, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 164, Positive conditional cache size: 23, Positive unconditional cache size: 141, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 36 PlacesBefore, 35 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 1, independent: 1, independent conditional: 1, 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: 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: 11, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 191, Positive conditional cache size: 24, Positive unconditional cache size: 167, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-3, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=-2, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=-1, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 558 IncrementalHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 8 mSDtfsCounter, 558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 22:54:37,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...