/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:14:11,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:14:11,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:14:11,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:14:11,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:14:11,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:14:11,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:14:11,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:14:11,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:14:11,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:14:11,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:14:11,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:14:11,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:14:11,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:14:11,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:14:11,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:14:11,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:14:11,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:14:11,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:14:11,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:14:11,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:14:11,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:14:11,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:14:11,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:14:11,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:14:11,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:14:11,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:14:11,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:14:11,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:14:11,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:14:11,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:14:11,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:14:11,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:14:11,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:14:11,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:14:11,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:14:11,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:14:11,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:14:11,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:14:11,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:14:11,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:14:11,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:14:11,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:14:11,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:14:11,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:14:11,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:14:11,795 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:14:11,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:14:11,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:14:11,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:14:11,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:14:11,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:14:11,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:14:11,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:14:11,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:14:11,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:14:11,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:11,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:14:11,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:14:11,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:14:11,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:14:11,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:14:11,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:14:11,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:14:12,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:14:12,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:14:12,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:14:12,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:14:12,088 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:14:12,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-06 04:14:13,117 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:14:13,354 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:14:13,355 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-12-06 04:14:13,373 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91242c9d7/5ad6c2e40d854576aea2fad8878e6e6f/FLAGd2339b9ce [2022-12-06 04:14:13,384 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91242c9d7/5ad6c2e40d854576aea2fad8878e6e6f [2022-12-06 04:14:13,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:14:13,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:14:13,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:13,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:14:13,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:14:13,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94c8267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13, skipping insertion in model container [2022-12-06 04:14:13,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:14:13,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:14:13,590 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/mix035_pso.opt_tso.opt.i[956,969] [2022-12-06 04:14:13,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:13,759 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:14:13,768 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/mix035_pso.opt_tso.opt.i[956,969] [2022-12-06 04:14:13,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:13,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:13,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:13,822 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:14:13,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13 WrapperNode [2022-12-06 04:14:13,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:13,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:13,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:14:13,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:14:13,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,859 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-12-06 04:14:13,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:13,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:14:13,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:14:13,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:14:13,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:14:13,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:14:13,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:14:13,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:14:13,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (1/1) ... [2022-12-06 04:14:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:13,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:14:13,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:14:13,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:14:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:14:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:14:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:14:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:14:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:14:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:14:13,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:14:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:14:13,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:14:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:14:13,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:14:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:14:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:14:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:14:13,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:14:13,968 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:14:14,084 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:14:14,086 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:14:14,381 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:14:14,482 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:14:14,482 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:14:14,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:14 BoogieIcfgContainer [2022-12-06 04:14:14,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:14:14,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:14:14,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:14:14,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:14:14,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:14:13" (1/3) ... [2022-12-06 04:14:14,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b15560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:14, skipping insertion in model container [2022-12-06 04:14:14,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:13" (2/3) ... [2022-12-06 04:14:14,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b15560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:14, skipping insertion in model container [2022-12-06 04:14:14,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:14" (3/3) ... [2022-12-06 04:14:14,490 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2022-12-06 04:14:14,503 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:14:14,503 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:14:14,503 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:14:14,545 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:14:14,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 04:14:14,612 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 04:14:14,612 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:14,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:14:14,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 04:14:14,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-06 04:14:14,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:14,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-06 04:14:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-06 04:14:14,676 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 04:14:14,676 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:14,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:14:14,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-06 04:14:14,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-06 04:14:18,416 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-06 04:14:18,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:14:18,431 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;@4804a5df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:14:18,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:14:18,434 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:14:18,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:18,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:18,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:18,435 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-06 04:14:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1374305503, now seen corresponding path program 1 times [2022-12-06 04:14:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:18,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330120829] [2022-12-06 04:14:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:18,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330120829] [2022-12-06 04:14:18,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330120829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:18,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:18,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704473946] [2022-12-06 04:14:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:18,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:18,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:18,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:14:18,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 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-06 04:14:18,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:18,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:14:18,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:18,988 INFO L130 PetriNetUnfolder]: 777/1242 cut-off events. [2022-12-06 04:14:18,988 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:14:18,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1242 events. 777/1242 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5944 event pairs, 129 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 2436. Up to 937 conditions per place. [2022-12-06 04:14:18,995 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 24 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 04:14:18,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2022-12-06 04:14:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 04:14:19,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 04:14:19,004 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 41 transitions. [2022-12-06 04:14:19,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2022-12-06 04:14:19,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:19,007 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 04:14:19,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 04:14:19,010 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 04:14:19,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:19,011 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 04:14:19,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:19,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:19,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 04:14:19,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 04:14:19,017 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:14:19,017 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:19,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:14:19,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 04:14:19,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 04:14:19,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:19,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 04:14:19,206 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 04:14:19,206 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-06 04:14:19,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:19,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:19,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:14:19,206 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-06 04:14:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2142376289, now seen corresponding path program 1 times [2022-12-06 04:14:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:19,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632414985] [2022-12-06 04:14:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632414985] [2022-12-06 04:14:19,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632414985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:19,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:19,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152922221] [2022-12-06 04:14:19,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:19,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:19,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:14:19,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:19,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:19,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:14:19,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:19,518 INFO L130 PetriNetUnfolder]: 699/1056 cut-off events. [2022-12-06 04:14:19,518 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 04:14:19,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1056 events. 699/1056 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3998 event pairs, 259 based on Foata normal form. 4/1060 useless extension candidates. Maximal degree in co-relation 2208. Up to 1013 conditions per place. [2022-12-06 04:14:19,524 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2022-12-06 04:14:19,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 136 flow [2022-12-06 04:14:19,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:14:19,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2022-12-06 04:14:19,525 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:14:19,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 136 flow [2022-12-06 04:14:19,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:19,528 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 70 flow [2022-12-06 04:14:19,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2022-12-06 04:14:19,528 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 04:14:19,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:19,529 INFO L89 Accepts]: Start accepts. Operand has 29 places, 22 transitions, 70 flow [2022-12-06 04:14:19,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:19,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:19,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 70 flow [2022-12-06 04:14:19,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 70 flow [2022-12-06 04:14:19,535 INFO L130 PetriNetUnfolder]: 14/61 cut-off events. [2022-12-06 04:14:19,535 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:19,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 61 events. 14/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 6 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 94. Up to 29 conditions per place. [2022-12-06 04:14:19,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 70 flow [2022-12-06 04:14:19,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 04:14:19,539 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:19,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:14:19,540 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 70 flow [2022-12-06 04:14:19,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:19,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:19,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:19,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:14:19,542 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-06 04:14:19,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1989157311, now seen corresponding path program 1 times [2022-12-06 04:14:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:19,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409232838] [2022-12-06 04:14:19,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:19,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:19,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409232838] [2022-12-06 04:14:19,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409232838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:19,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:19,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447104232] [2022-12-06 04:14:19,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:19,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:19,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:14:19,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:19,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:19,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:14:19,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:19,851 INFO L130 PetriNetUnfolder]: 379/665 cut-off events. [2022-12-06 04:14:19,851 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 04:14:19,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 665 events. 379/665 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3016 event pairs, 76 based on Foata normal form. 62/720 useless extension candidates. Maximal degree in co-relation 1515. Up to 280 conditions per place. [2022-12-06 04:14:19,855 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 35 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2022-12-06 04:14:19,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 204 flow [2022-12-06 04:14:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 04:14:19,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 04:14:19,857 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 70 flow. Second operand 4 states and 48 transitions. [2022-12-06 04:14:19,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 204 flow [2022-12-06 04:14:19,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:14:19,858 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 104 flow [2022-12-06 04:14:19,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 04:14:19,859 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2022-12-06 04:14:19,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:19,860 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 104 flow [2022-12-06 04:14:19,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:19,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:19,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 104 flow [2022-12-06 04:14:19,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 104 flow [2022-12-06 04:14:19,873 INFO L130 PetriNetUnfolder]: 50/143 cut-off events. [2022-12-06 04:14:19,873 INFO L131 PetriNetUnfolder]: For 19/24 co-relation queries the response was YES. [2022-12-06 04:14:19,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 143 events. 50/143 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 681 event pairs, 22 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 302. Up to 75 conditions per place. [2022-12-06 04:14:19,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 104 flow [2022-12-06 04:14:19,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:14:20,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:20,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-06 04:14:20,006 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 106 flow [2022-12-06 04:14:20,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:20,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:20,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:20,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:14:20,007 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-06 04:14:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1308533226, now seen corresponding path program 1 times [2022-12-06 04:14:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:20,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001641397] [2022-12-06 04:14:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:20,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:20,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001641397] [2022-12-06 04:14:20,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001641397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:20,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:20,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:14:20,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111829119] [2022-12-06 04:14:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:20,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:20,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:14:20,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 106 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:20,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:20,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:14:20,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:20,239 INFO L130 PetriNetUnfolder]: 374/620 cut-off events. [2022-12-06 04:14:20,239 INFO L131 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2022-12-06 04:14:20,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 620 events. 374/620 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2326 event pairs, 83 based on Foata normal form. 7/627 useless extension candidates. Maximal degree in co-relation 1811. Up to 475 conditions per place. [2022-12-06 04:14:20,243 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 04:14:20,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 213 flow [2022-12-06 04:14:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 04:14:20,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 04:14:20,247 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 106 flow. Second operand 3 states and 28 transitions. [2022-12-06 04:14:20,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 213 flow [2022-12-06 04:14:20,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 199 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:20,250 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 103 flow [2022-12-06 04:14:20,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-06 04:14:20,250 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-06 04:14:20,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:20,250 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 103 flow [2022-12-06 04:14:20,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:20,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:20,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 103 flow [2022-12-06 04:14:20,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 103 flow [2022-12-06 04:14:20,260 INFO L130 PetriNetUnfolder]: 36/104 cut-off events. [2022-12-06 04:14:20,260 INFO L131 PetriNetUnfolder]: For 17/20 co-relation queries the response was YES. [2022-12-06 04:14:20,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 104 events. 36/104 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 400 event pairs, 14 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 217. Up to 51 conditions per place. [2022-12-06 04:14:20,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 103 flow [2022-12-06 04:14:20,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 04:14:20,265 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:20,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 04:14:20,270 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 103 flow [2022-12-06 04:14:20,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:20,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:20,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:20,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:14:20,270 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-06 04:14:20,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash -846610056, now seen corresponding path program 1 times [2022-12-06 04:14:20,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:20,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68498339] [2022-12-06 04:14:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:20,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:20,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68498339] [2022-12-06 04:14:20,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68498339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:20,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:20,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:20,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167531957] [2022-12-06 04:14:20,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:20,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:14:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:20,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:14:20,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:14:20,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:14:20,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-06 04:14:20,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:20,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:14:20,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:20,501 INFO L130 PetriNetUnfolder]: 183/357 cut-off events. [2022-12-06 04:14:20,502 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-06 04:14:20,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 357 events. 183/357 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1413 event pairs, 34 based on Foata normal form. 37/392 useless extension candidates. Maximal degree in co-relation 1009. Up to 148 conditions per place. [2022-12-06 04:14:20,505 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 42 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-06 04:14:20,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 299 flow [2022-12-06 04:14:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 04:14:20,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 04:14:20,506 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 103 flow. Second operand 5 states and 60 transitions. [2022-12-06 04:14:20,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 299 flow [2022-12-06 04:14:20,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:20,510 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 150 flow [2022-12-06 04:14:20,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-06 04:14:20,511 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 04:14:20,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:20,512 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 150 flow [2022-12-06 04:14:20,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:20,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:20,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 150 flow [2022-12-06 04:14:20,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 150 flow [2022-12-06 04:14:20,521 INFO L130 PetriNetUnfolder]: 24/88 cut-off events. [2022-12-06 04:14:20,521 INFO L131 PetriNetUnfolder]: For 90/94 co-relation queries the response was YES. [2022-12-06 04:14:20,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 88 events. 24/88 cut-off events. For 90/94 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 318 event pairs, 3 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 254. Up to 44 conditions per place. [2022-12-06 04:14:20,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 150 flow [2022-12-06 04:14:20,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 04:14:20,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:20,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 04:14:20,640 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 154 flow [2022-12-06 04:14:20,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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-06 04:14:20,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:20,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:20,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:14:20,640 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-06 04:14:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1314535874, now seen corresponding path program 1 times [2022-12-06 04:14:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:20,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614464921] [2022-12-06 04:14:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:20,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614464921] [2022-12-06 04:14:20,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614464921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:20,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:20,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967497653] [2022-12-06 04:14:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:20,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:20,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:20,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:14:20,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 154 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-06 04:14:20,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:20,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:14:20,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:20,851 INFO L130 PetriNetUnfolder]: 208/404 cut-off events. [2022-12-06 04:14:20,851 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-12-06 04:14:20,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 404 events. 208/404 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1624 event pairs, 40 based on Foata normal form. 6/410 useless extension candidates. Maximal degree in co-relation 1403. Up to 217 conditions per place. [2022-12-06 04:14:20,853 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 40 selfloop transitions, 2 changer transitions 16/59 dead transitions. [2022-12-06 04:14:20,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 438 flow [2022-12-06 04:14:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:14:20,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:14:20,854 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 154 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:14:20,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 59 transitions, 438 flow [2022-12-06 04:14:20,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 381 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 04:14:20,857 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 140 flow [2022-12-06 04:14:20,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-06 04:14:20,857 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 04:14:20,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:20,857 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 140 flow [2022-12-06 04:14:20,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:20,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:20,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 140 flow [2022-12-06 04:14:20,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 140 flow [2022-12-06 04:14:20,866 INFO L130 PetriNetUnfolder]: 25/101 cut-off events. [2022-12-06 04:14:20,866 INFO L131 PetriNetUnfolder]: For 55/64 co-relation queries the response was YES. [2022-12-06 04:14:20,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 101 events. 25/101 cut-off events. For 55/64 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 394 event pairs, 5 based on Foata normal form. 5/103 useless extension candidates. Maximal degree in co-relation 258. Up to 44 conditions per place. [2022-12-06 04:14:20,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 140 flow [2022-12-06 04:14:20,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 04:14:21,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:21,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 04:14:21,033 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 143 flow [2022-12-06 04:14:21,033 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-06 04:14:21,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:21,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:21,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:14:21,034 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-06 04:14:21,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash -454716290, now seen corresponding path program 2 times [2022-12-06 04:14:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:21,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071757677] [2022-12-06 04:14:21,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:21,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071757677] [2022-12-06 04:14:21,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071757677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:21,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:21,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:14:21,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215471336] [2022-12-06 04:14:21,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:21,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:14:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:21,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:14:21,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:14:21,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:14:21,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:21,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:21,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:14:21,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:21,302 INFO L130 PetriNetUnfolder]: 155/313 cut-off events. [2022-12-06 04:14:21,302 INFO L131 PetriNetUnfolder]: For 325/344 co-relation queries the response was YES. [2022-12-06 04:14:21,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 313 events. 155/313 cut-off events. For 325/344 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1291 event pairs, 37 based on Foata normal form. 30/335 useless extension candidates. Maximal degree in co-relation 989. Up to 111 conditions per place. [2022-12-06 04:14:21,303 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 28 selfloop transitions, 11 changer transitions 4/46 dead transitions. [2022-12-06 04:14:21,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 284 flow [2022-12-06 04:14:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-06 04:14:21,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 04:14:21,306 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 143 flow. Second operand 6 states and 55 transitions. [2022-12-06 04:14:21,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 284 flow [2022-12-06 04:14:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 271 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:21,308 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 156 flow [2022-12-06 04:14:21,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2022-12-06 04:14:21,309 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-06 04:14:21,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:21,309 INFO L89 Accepts]: Start accepts. Operand has 44 places, 27 transitions, 156 flow [2022-12-06 04:14:21,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:21,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:21,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 156 flow [2022-12-06 04:14:21,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 27 transitions, 156 flow [2022-12-06 04:14:21,315 INFO L130 PetriNetUnfolder]: 9/43 cut-off events. [2022-12-06 04:14:21,315 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 04:14:21,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 43 events. 9/43 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 1 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2022-12-06 04:14:21,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 27 transitions, 156 flow [2022-12-06 04:14:21,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 04:14:21,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L753-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [446] L840-3-->L851: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_130 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_306 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_307 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_283 256) 0)) .cse3))) (and (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_155 3) 1 0) 0) 0 1)) (= v_~y$r_buff0_thd0~0_129 (ite .cse0 0 v_~y$r_buff0_thd0~0_130)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~y$w_buff1_used~0_282 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_283)) (= v_~y$w_buff0_used~0_306 (ite .cse2 0 v_~y$w_buff0_used~0_307)) (= v_~y~0_228 (ite .cse2 v_~y$w_buff0~0_199 (ite .cse1 v_~y$w_buff1~0_176 v_~y~0_229))) (= v_~y$r_buff1_thd0~0_129 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_282 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_130)) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$w_buff1~0=v_~y$w_buff1~0_176, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_130, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~y~0=v_~y~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_283} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_306, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_176, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_199, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~y~0=v_~y~0_228, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_282, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:14:21,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] L818-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P2Thread1of1ForFork1_#res#1.base_7| 0) (= |v_P2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] and [446] L840-3-->L851: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_130 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_306 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_307 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_283 256) 0)) .cse3))) (and (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_155 3) 1 0) 0) 0 1)) (= v_~y$r_buff0_thd0~0_129 (ite .cse0 0 v_~y$r_buff0_thd0~0_130)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~y$w_buff1_used~0_282 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_283)) (= v_~y$w_buff0_used~0_306 (ite .cse2 0 v_~y$w_buff0_used~0_307)) (= v_~y~0_228 (ite .cse2 v_~y$w_buff0~0_199 (ite .cse1 v_~y$w_buff1~0_176 v_~y~0_229))) (= v_~y$r_buff1_thd0~0_129 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_282 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_130)) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$w_buff1~0=v_~y$w_buff1~0_176, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_130, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~y~0=v_~y~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_283} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_306, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_176, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_199, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~y~0=v_~y~0_228, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_282, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:14:21,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [415] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_7| 0) (= |v_P1Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [446] L840-3-->L851: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_130 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_306 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_307 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_283 256) 0)) .cse3))) (and (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_155 3) 1 0) 0) 0 1)) (= v_~y$r_buff0_thd0~0_129 (ite .cse0 0 v_~y$r_buff0_thd0~0_130)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~y$w_buff1_used~0_282 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_283)) (= v_~y$w_buff0_used~0_306 (ite .cse2 0 v_~y$w_buff0_used~0_307)) (= v_~y~0_228 (ite .cse2 v_~y$w_buff0~0_199 (ite .cse1 v_~y$w_buff1~0_176 v_~y~0_229))) (= v_~y$r_buff1_thd0~0_129 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_282 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_129 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_130)) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$w_buff1~0=v_~y$w_buff1~0_176, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_130, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~y~0=v_~y~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_283} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_43|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_306, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_176, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_129, ~y$w_buff0~0=v_~y$w_buff0~0_199, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~y~0=v_~y~0_228, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_282, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:14:22,842 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:14:22,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1534 [2022-12-06 04:14:22,843 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 152 flow [2022-12-06 04:14:22,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:22,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:22,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:22,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:14:22,844 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-06 04:14:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash -792892172, now seen corresponding path program 1 times [2022-12-06 04:14:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:22,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405857391] [2022-12-06 04:14:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405857391] [2022-12-06 04:14:22,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405857391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:22,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:22,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936719366] [2022-12-06 04:14:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:22,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:22,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:22,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:14:22,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 152 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:22,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:22,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:14:22,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:23,079 INFO L130 PetriNetUnfolder]: 101/208 cut-off events. [2022-12-06 04:14:23,079 INFO L131 PetriNetUnfolder]: For 464/464 co-relation queries the response was YES. [2022-12-06 04:14:23,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 208 events. 101/208 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 751 event pairs, 16 based on Foata normal form. 3/211 useless extension candidates. Maximal degree in co-relation 785. Up to 133 conditions per place. [2022-12-06 04:14:23,080 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 34 selfloop transitions, 9 changer transitions 6/49 dead transitions. [2022-12-06 04:14:23,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 384 flow [2022-12-06 04:14:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 04:14:23,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 04:14:23,081 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 152 flow. Second operand 5 states and 43 transitions. [2022-12-06 04:14:23,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 384 flow [2022-12-06 04:14:23,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 282 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-12-06 04:14:23,083 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 152 flow [2022-12-06 04:14:23,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=90, 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-06 04:14:23,084 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 04:14:23,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:23,084 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 152 flow [2022-12-06 04:14:23,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:23,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:23,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 152 flow [2022-12-06 04:14:23,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 152 flow [2022-12-06 04:14:23,091 INFO L130 PetriNetUnfolder]: 18/71 cut-off events. [2022-12-06 04:14:23,091 INFO L131 PetriNetUnfolder]: For 41/44 co-relation queries the response was YES. [2022-12-06 04:14:23,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 71 events. 18/71 cut-off events. For 41/44 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 265 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 166. Up to 22 conditions per place. [2022-12-06 04:14:23,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 152 flow [2022-12-06 04:14:23,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 04:14:23,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:23,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 04:14:23,197 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 152 flow [2022-12-06 04:14:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:23,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:23,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:23,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:14:23,198 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-06 04:14:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1984390005, now seen corresponding path program 1 times [2022-12-06 04:14:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:23,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677385521] [2022-12-06 04:14:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:23,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:23,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677385521] [2022-12-06 04:14:23,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677385521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:23,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:23,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528634338] [2022-12-06 04:14:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:23,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:23,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:23,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:23,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:14:23,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:23,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:23,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:14:23,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:23,416 INFO L130 PetriNetUnfolder]: 107/235 cut-off events. [2022-12-06 04:14:23,416 INFO L131 PetriNetUnfolder]: For 342/350 co-relation queries the response was YES. [2022-12-06 04:14:23,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 235 events. 107/235 cut-off events. For 342/350 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 981 event pairs, 29 based on Foata normal form. 3/238 useless extension candidates. Maximal degree in co-relation 781. Up to 114 conditions per place. [2022-12-06 04:14:23,418 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 21 selfloop transitions, 1 changer transitions 23/46 dead transitions. [2022-12-06 04:14:23,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 310 flow [2022-12-06 04:14:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 04:14:23,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 04:14:23,428 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 152 flow. Second operand 4 states and 40 transitions. [2022-12-06 04:14:23,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 310 flow [2022-12-06 04:14:23,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 308 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:14:23,429 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 109 flow [2022-12-06 04:14:23,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2022-12-06 04:14:23,430 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-06 04:14:23,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:23,431 INFO L89 Accepts]: Start accepts. Operand has 40 places, 21 transitions, 109 flow [2022-12-06 04:14:23,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:23,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:23,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 21 transitions, 109 flow [2022-12-06 04:14:23,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 109 flow [2022-12-06 04:14:23,437 INFO L130 PetriNetUnfolder]: 7/35 cut-off events. [2022-12-06 04:14:23,437 INFO L131 PetriNetUnfolder]: For 37/44 co-relation queries the response was YES. [2022-12-06 04:14:23,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 35 events. 7/35 cut-off events. For 37/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 84. Up to 10 conditions per place. [2022-12-06 04:14:23,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 109 flow [2022-12-06 04:14:23,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 04:14:23,553 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:14:23,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 04:14:23,554 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 105 flow [2022-12-06 04:14:23,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:14:23,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:23,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:23,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:14:23,554 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-06 04:14:23,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1647320561, now seen corresponding path program 1 times [2022-12-06 04:14:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:23,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752961756] [2022-12-06 04:14:23,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:23,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752961756] [2022-12-06 04:14:23,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752961756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:23,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517886843] [2022-12-06 04:14:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:23,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:14:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:14:23,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:14:23,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:14:23,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 19 transitions, 105 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-06 04:14:23,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:23,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:14:23,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:23,904 INFO L130 PetriNetUnfolder]: 24/68 cut-off events. [2022-12-06 04:14:23,904 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-06 04:14:23,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 68 events. 24/68 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 1 based on Foata normal form. 3/71 useless extension candidates. Maximal degree in co-relation 227. Up to 29 conditions per place. [2022-12-06 04:14:23,905 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 17 selfloop transitions, 6 changer transitions 8/31 dead transitions. [2022-12-06 04:14:23,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 228 flow [2022-12-06 04:14:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-12-06 04:14:23,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-06 04:14:23,906 INFO L175 Difference]: Start difference. First operand has 36 places, 19 transitions, 105 flow. Second operand 6 states and 26 transitions. [2022-12-06 04:14:23,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 228 flow [2022-12-06 04:14:23,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 198 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 04:14:23,907 INFO L231 Difference]: Finished difference. Result has 36 places, 19 transitions, 99 flow [2022-12-06 04:14:23,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=19} [2022-12-06 04:14:23,908 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 04:14:23,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:23,908 INFO L89 Accepts]: Start accepts. Operand has 36 places, 19 transitions, 99 flow [2022-12-06 04:14:23,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:23,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:23,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 19 transitions, 99 flow [2022-12-06 04:14:23,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 19 transitions, 99 flow [2022-12-06 04:14:23,915 INFO L130 PetriNetUnfolder]: 7/32 cut-off events. [2022-12-06 04:14:23,915 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:14:23,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 32 events. 7/32 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 76. Up to 10 conditions per place. [2022-12-06 04:14:23,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 19 transitions, 99 flow [2022-12-06 04:14:23,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 04:14:24,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] L781-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_154 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_154 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_340 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_341 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_317 256) 0))))) (and (= v_~y$r_buff0_thd0~0_153 (ite .cse0 0 v_~y$r_buff0_thd0~0_154)) (= (mod v_~main$tmp_guard1~0_91 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_76|) (= v_~__unbuffered_cnt~0_177 (+ v_~__unbuffered_cnt~0_178 1)) (= |v_P1Thread1of1ForFork0_#res.base_27| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_103 0) (= v_~__unbuffered_p2_EAX~0_104 1) (= v_~__unbuffered_p1_EAX~0_130 0) (= v_~__unbuffered_p0_EAX~0_101 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_91) (= |v_P1Thread1of1ForFork0_#res.offset_27| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| 0)) (= v_~main$tmp_guard0~0_88 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1)) (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_317) v_~y$w_buff1_used~0_316) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_76| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67| (mod v_~main$tmp_guard0~0_88 256)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_79| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= (ite .cse2 0 v_~y$w_buff0_used~0_341) v_~y$w_buff0_used~0_340) (= v_~y$r_buff1_thd0~0_153 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_153 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_316 256) 0)))) 0 v_~y$r_buff1_thd0~0_154)) (= v_~y~0_262 (ite .cse2 v_~y$w_buff0~0_219 (ite .cse1 v_~y$w_buff1~0_196 v_~y~0_263))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_76| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_76|)))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_130, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_341, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_219, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_104, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_178, ~y~0=v_~y~0_263, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_154, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_76|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_55|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_340, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_76|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$w_buff0~0=v_~y$w_buff0~0_219, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_79|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_104, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ~y~0=v_~y~0_262, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, P1Thread1of1ForFork0_#res.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_cnt~0, ~y~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork0_#res.base, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [455] $Ultimate##0-->L811: Formula: (and (= v_~y$w_buff1~0_204 v_~y$w_buff0~0_230) (= v_~y$r_buff0_thd3~0_147 v_~y$r_buff1_thd3~0_114) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|) (= v_~y$r_buff0_thd0~0_159 v_~y$r_buff1_thd0~0_159) (= v_~z~0_41 1) (= v_~y$r_buff0_thd2~0_168 v_~y$r_buff1_thd2~0_167) (= |v_P2Thread1of1ForFork1_~arg#1.base_28| |v_P2Thread1of1ForFork1_#in~arg#1.base_28|) (= v_~z~0_41 v_~__unbuffered_p2_EAX~0_108) (= v_~y$r_buff0_thd3~0_146 1) (= v_~y$w_buff0_used~0_355 v_~y$w_buff1_used~0_328) (= v_~y$w_buff0_used~0_354 1) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_328 256) 0)) (not (= (mod v_~y$w_buff0_used~0_354 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|) (= v_~a~0_41 v_~__unbuffered_p2_EBX~0_107) (= v_~y$r_buff0_thd1~0_46 v_~y$r_buff1_thd1~0_44) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_28| |v_P2Thread1of1ForFork1_~arg#1.offset_28|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32| 0)) (= v_~y$w_buff0~0_229 1)) InVars {~a~0=v_~a~0_41, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_28|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_355, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_230, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_28|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_354, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_28|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_167, ~a~0=v_~a~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_44, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_114, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_28|, ~y$w_buff1~0=v_~y$w_buff1~0_204, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_146, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_229, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_28|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~z~0=v_~z~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_328} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:14:24,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] L753-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_332 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd0~0_146 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_146 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_333 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_309 256) 0)) .cse1)) (.cse3 (and .cse5 .cse2))) (and (= v_~__unbuffered_cnt~0_169 (+ v_~__unbuffered_cnt~0_170 1)) (= |v_P0Thread1of1ForFork2_#res.base_29| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_72| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_72|) (= v_~y$w_buff0_used~0_332 (ite .cse0 0 v_~y$w_buff0_used~0_333)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_72| 0) (= |v_P0Thread1of1ForFork2_#res.offset_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_72| (mod v_~main$tmp_guard1~0_87 256)) (= v_~y$r_buff1_thd0~0_145 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_308 256) 0)) .cse1) (and (not (= (mod v_~y$r_buff0_thd0~0_145 256) 0)) .cse2)) 0 v_~y$r_buff1_thd0~0_146)) (= v_~y$w_buff1_used~0_308 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_309)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_99 0) (= v_~__unbuffered_p1_EAX~0_126 0) (= v_~__unbuffered_p0_EAX~0_97 0) (= v_~__unbuffered_p2_EAX~0_100 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_87) (= v_~y~0_254 (ite .cse0 v_~y$w_buff0~0_215 (ite .cse4 v_~y$w_buff1~0_192 v_~y~0_255))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_75| 0)) (= v_~y$r_buff0_thd0~0_145 (ite .cse3 0 v_~y$r_buff0_thd0~0_146)) (= (mod v_~main$tmp_guard0~0_84 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~main$tmp_guard0~0_84 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_99, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_333, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_100, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_170, ~y~0=v_~y~0_255, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_309} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_72|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_99, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_51|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_332, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_63|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_87, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_84, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_29|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_72|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_215, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_75|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_100, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ~y~0=v_~y~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_145, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_308, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, P0Thread1of1ForFork2_#res.offset, ~main$tmp_guard0~0, P0Thread1of1ForFork2_#res.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_cnt~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [455] $Ultimate##0-->L811: Formula: (and (= v_~y$w_buff1~0_204 v_~y$w_buff0~0_230) (= v_~y$r_buff0_thd3~0_147 v_~y$r_buff1_thd3~0_114) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|) (= v_~y$r_buff0_thd0~0_159 v_~y$r_buff1_thd0~0_159) (= v_~z~0_41 1) (= v_~y$r_buff0_thd2~0_168 v_~y$r_buff1_thd2~0_167) (= |v_P2Thread1of1ForFork1_~arg#1.base_28| |v_P2Thread1of1ForFork1_#in~arg#1.base_28|) (= v_~z~0_41 v_~__unbuffered_p2_EAX~0_108) (= v_~y$r_buff0_thd3~0_146 1) (= v_~y$w_buff0_used~0_355 v_~y$w_buff1_used~0_328) (= v_~y$w_buff0_used~0_354 1) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_328 256) 0)) (not (= (mod v_~y$w_buff0_used~0_354 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|) (= v_~a~0_41 v_~__unbuffered_p2_EBX~0_107) (= v_~y$r_buff0_thd1~0_46 v_~y$r_buff1_thd1~0_44) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_28| |v_P2Thread1of1ForFork1_~arg#1.offset_28|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32| 0)) (= v_~y$w_buff0~0_229 1)) InVars {~a~0=v_~a~0_41, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_28|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_355, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_230, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_28|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_354, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_28|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_167, ~a~0=v_~a~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_44, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_114, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_28|, ~y$w_buff1~0=v_~y$w_buff1~0_204, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_146, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_229, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_28|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~z~0=v_~z~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_328} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:14:24,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L811-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd3~0_151 256) 0)))) (let ((.cse9 (and (not (= (mod v_~y$w_buff0_used~0_360 256) 0)) .cse14))) (let ((.cse11 (ite .cse9 0 v_~y$w_buff0_used~0_360))) (let ((.cse6 (not (= (mod v_~y$r_buff1_thd3~0_117 256) 0))) (.cse7 (not (= (mod .cse11 256) 0)))) (let ((.cse12 (and .cse14 .cse7)) (.cse10 (and (not (= (mod v_~y$w_buff1_used~0_332 256) 0)) .cse6))) (let ((.cse4 (ite (or .cse12 .cse10) 0 v_~y$w_buff1_used~0_332))) (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_358 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd0~0_162 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd0~0_162 256) 0))) (.cse5 (not (= (mod .cse4 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse3 (and .cse1 .cse13)) (.cse8 (and .cse13 .cse7))) (and (= v_~main$tmp_guard1~0_93 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_110 1) (= v_~__unbuffered_p2_EBX~0_109 0) (= v_~__unbuffered_p0_EAX~0_105 0) (= v_~__unbuffered_p1_EAX~0_134 0))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_161 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_330 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_161 256) 0)))) 0 v_~y$r_buff1_thd0~0_162)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_81| 0)) (= (ite (or .cse2 .cse3) 0 .cse4) v_~y$w_buff1_used~0_330) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_90 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_78| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_78|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_78| 0) (= (mod v_~main$tmp_guard1~0_93 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_78|) (= v_~y$r_buff1_thd3~0_116 (ite (or (and .cse5 .cse6) (and (not (= (mod v_~y$r_buff0_thd3~0_150 256) 0)) .cse7)) 0 v_~y$r_buff1_thd3~0_117)) (= v_~y~0_272 (ite .cse8 v_~y$w_buff0~0_233 (ite .cse2 v_~y$w_buff1~0_206 (ite .cse9 v_~y$w_buff0~0_233 (ite .cse10 v_~y$w_buff1~0_206 v_~y~0_274))))) (= v_~y$r_buff0_thd0~0_161 (ite .cse3 0 v_~y$r_buff0_thd0~0_162)) (= v_~y$w_buff0_used~0_358 (ite .cse8 0 .cse11)) (= v_~__unbuffered_cnt~0_181 (+ v_~__unbuffered_cnt~0_182 1)) (= |v_P2Thread1of1ForFork1_#res#1.offset_29| 0) (= (ite .cse12 0 v_~y$r_buff0_thd3~0_151) v_~y$r_buff0_thd3~0_150) (= |v_P2Thread1of1ForFork1_#res#1.base_29| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_90) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_81| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|)))))))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_109, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_360, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_117, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_134, ~y$w_buff1~0=v_~y$w_buff1~0_206, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_233, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_182, ~y~0=v_~y~0_274, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_162, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_332} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_78|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_57|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_358, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_69|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_90, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_29|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_116, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_78|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_134, ~y$w_buff1~0=v_~y$w_buff1~0_206, P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_29|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_161, ~y$w_buff0~0=v_~y$w_buff0~0_233, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_81|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_150, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~y~0=v_~y~0_272, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_330, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, P2Thread1of1ForFork1_#res#1.base, ~y$r_buff1_thd3~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, P2Thread1of1ForFork1_#res#1.offset, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [455] $Ultimate##0-->L811: Formula: (and (= v_~y$w_buff1~0_204 v_~y$w_buff0~0_230) (= v_~y$r_buff0_thd3~0_147 v_~y$r_buff1_thd3~0_114) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|) (= v_~y$r_buff0_thd0~0_159 v_~y$r_buff1_thd0~0_159) (= v_~z~0_41 1) (= v_~y$r_buff0_thd2~0_168 v_~y$r_buff1_thd2~0_167) (= |v_P2Thread1of1ForFork1_~arg#1.base_28| |v_P2Thread1of1ForFork1_#in~arg#1.base_28|) (= v_~z~0_41 v_~__unbuffered_p2_EAX~0_108) (= v_~y$r_buff0_thd3~0_146 1) (= v_~y$w_buff0_used~0_355 v_~y$w_buff1_used~0_328) (= v_~y$w_buff0_used~0_354 1) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_328 256) 0)) (not (= (mod v_~y$w_buff0_used~0_354 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|) (= v_~a~0_41 v_~__unbuffered_p2_EBX~0_107) (= v_~y$r_buff0_thd1~0_46 v_~y$r_buff1_thd1~0_44) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_28| |v_P2Thread1of1ForFork1_~arg#1.offset_28|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32| 0)) (= v_~y$w_buff0~0_229 1)) InVars {~a~0=v_~a~0_41, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_28|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_355, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_230, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_28|} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_354, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_28|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_167, ~a~0=v_~a~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_44, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_114, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_28|, ~y$w_buff1~0=v_~y$w_buff1~0_204, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_146, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_229, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_28|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_32|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~z~0=v_~z~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_159, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_328} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:14:25,825 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:14:25,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1918 [2022-12-06 04:14:25,826 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 145 flow [2022-12-06 04:14:25,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-06 04:14:25,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:25,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:25,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:14:25,827 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-06 04:14:25,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:25,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1725613890, now seen corresponding path program 1 times [2022-12-06 04:14:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:25,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006423736] [2022-12-06 04:14:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:25,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:14:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:25,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:14:25,893 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:14:25,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:14:25,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:14:25,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:14:25,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:14:25,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:14:25,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:14:25,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:14:25,896 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:25,902 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:14:25,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:14:25,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:14:25 BasicIcfg [2022-12-06 04:14:25,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:14:25,954 INFO L158 Benchmark]: Toolchain (without parser) took 12567.16ms. Allocated memory was 202.4MB in the beginning and 361.8MB in the end (delta: 159.4MB). Free memory was 177.7MB in the beginning and 145.8MB in the end (delta: 31.8MB). Peak memory consumption was 191.8MB. Max. memory is 8.0GB. [2022-12-06 04:14:25,954 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:14:25,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.60ms. Allocated memory is still 202.4MB. Free memory was 177.7MB in the beginning and 151.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:14:25,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.16ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 149.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:25,954 INFO L158 Benchmark]: Boogie Preprocessor took 20.60ms. Allocated memory is still 202.4MB. Free memory was 149.0MB in the beginning and 147.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:25,954 INFO L158 Benchmark]: RCFGBuilder took 599.49ms. Allocated memory is still 202.4MB. Free memory was 147.0MB in the beginning and 166.2MB in the end (delta: -19.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 04:14:25,954 INFO L158 Benchmark]: TraceAbstraction took 11467.15ms. Allocated memory was 202.4MB in the beginning and 361.8MB in the end (delta: 159.4MB). Free memory was 165.7MB in the beginning and 145.8MB in the end (delta: 19.9MB). Peak memory consumption was 179.3MB. Max. memory is 8.0GB. [2022-12-06 04:14:25,955 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 202.4MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.60ms. Allocated memory is still 202.4MB. Free memory was 177.7MB in the beginning and 151.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.16ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 149.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.60ms. Allocated memory is still 202.4MB. Free memory was 149.0MB in the beginning and 147.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 599.49ms. Allocated memory is still 202.4MB. Free memory was 147.0MB in the beginning and 166.2MB in the end (delta: -19.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11467.15ms. Allocated memory was 202.4MB in the beginning and 361.8MB in the end (delta: 159.4MB). Free memory was 165.7MB in the beginning and 145.8MB in the end (delta: 19.9MB). Peak memory consumption was 179.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 116 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 25 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1423, independent: 1371, independent conditional: 1371, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1423, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1423, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1423, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1161, independent: 1125, independent conditional: 0, independent unconditional: 1125, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1161, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1423, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1161, unknown conditional: 0, unknown unconditional: 1161] , Statistics on independence cache: Total cache size (in pairs): 1760, Positive cache size: 1724, Positive conditional cache size: 0, Positive unconditional cache size: 1724, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 134, independent conditional: 7, independent unconditional: 127, dependent: 37, dependent conditional: 5, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 134, independent conditional: 7, independent unconditional: 127, dependent: 37, dependent conditional: 5, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 134, independent conditional: 7, independent unconditional: 127, dependent: 37, dependent conditional: 5, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 72, independent conditional: 6, independent unconditional: 66, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 69, dependent conditional: 14, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, independent: 62, independent conditional: 1, independent unconditional: 61, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 89, unknown conditional: 9, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 72, Positive conditional cache size: 6, Positive unconditional cache size: 66, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, 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, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 58, independent conditional: 7, independent unconditional: 51, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 85, Positive conditional cache size: 6, Positive unconditional cache size: 79, Negative cache size: 18, Negative conditional cache size: 3, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 110, independent conditional: 49, independent unconditional: 61, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 110, independent conditional: 10, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 110, independent conditional: 10, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 130, independent: 106, independent conditional: 10, independent unconditional: 96, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 98, Positive conditional cache size: 6, Positive unconditional cache size: 92, Negative cache size: 19, Negative conditional cache size: 3, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 13, independent unconditional: 28, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 41, independent conditional: 2, independent unconditional: 39, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 2, independent unconditional: 39, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 37, independent conditional: 2, independent unconditional: 35, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 6, Positive unconditional cache size: 96, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, 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.1s, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 87, independent conditional: 39, independent unconditional: 48, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 87, independent conditional: 12, independent unconditional: 75, 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: 115, independent: 87, independent conditional: 12, independent unconditional: 75, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, independent: 87, independent conditional: 12, independent unconditional: 75, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 111, Positive conditional cache size: 6, Positive unconditional cache size: 105, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 130, independent conditional: 70, independent unconditional: 60, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 130, independent conditional: 34, independent unconditional: 96, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 130, independent conditional: 34, independent unconditional: 96, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 125, independent conditional: 34, independent unconditional: 91, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 125, Positive conditional cache size: 6, Positive unconditional cache size: 119, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 43 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 23 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 91, independent conditional: 91, 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: 107, independent: 91, independent conditional: 49, independent unconditional: 42, 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: 107, independent: 91, independent conditional: 44, independent unconditional: 47, 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: 107, independent: 91, independent conditional: 44, independent unconditional: 47, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 89, independent conditional: 44, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 159, Positive conditional cache size: 6, Positive unconditional cache size: 153, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 70, independent conditional: 48, independent unconditional: 22, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 70, independent conditional: 37, independent unconditional: 33, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 70, independent conditional: 37, independent unconditional: 33, dependent: 11, dependent conditional: 0, dependent unconditional: 11, 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: 81, independent: 69, independent conditional: 36, independent unconditional: 33, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 163, Positive conditional cache size: 7, Positive unconditional cache size: 156, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 36 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 53, independent conditional: 53, 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: 67, independent: 53, independent conditional: 37, independent unconditional: 16, 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: 67, independent: 53, independent conditional: 37, independent unconditional: 16, 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: 67, independent: 53, independent conditional: 37, independent unconditional: 16, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 52, independent conditional: 37, independent unconditional: 15, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 189, Positive conditional cache size: 8, Positive unconditional cache size: 181, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, 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: 1.9s, 35 PlacesBefore, 35 PlacesAfterwards, 19 TransitionsBefore, 21 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 211, Positive conditional cache size: 8, Positive unconditional cache size: 203, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, 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_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-3, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t923, ((void *)0), P1, ((void *)0))=-2, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t924, ((void *)0), P2, ((void *)0))=-1, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 a = 1 [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L842] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 2 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 2 !(!cond) [L844] RET 2 assume_abort_if_not(main$tmp_guard0) [L846] 2 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 2 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 2 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L853] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: 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, 138 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: 11.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 8 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=7, InterpolantAutomatonStates: 43, 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.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:14:25,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...