/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:59:15,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:59:15,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:59:15,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:59:15,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:59:15,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:59:15,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:59:15,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:59:15,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:59:15,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:59:15,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:59:15,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:59:15,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:59:15,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:59:15,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:59:15,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:59:15,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:59:15,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:59:15,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:59:16,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:59:16,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:59:16,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:59:16,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:59:16,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:59:16,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:59:16,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:59:16,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:59:16,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:59:16,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:59:16,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:59:16,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:59:16,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:59:16,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:59:16,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:59:16,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:59:16,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:59:16,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:59:16,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:59:16,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:59:16,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:59:16,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:59:16,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:59:16,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:59:16,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:59:16,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:59:16,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:59:16,043 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:59:16,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:59:16,054 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:59:16,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:59:16,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:59:16,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:59:16,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:59:16,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:59:16,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:59:16,055 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:59:16,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:59:16,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:59:16,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:59:16,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:59:16,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:59:16,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:59:16,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:59:16,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:59:16,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:59:16,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:59:16,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:59:16,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:59:16,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:59:16,057 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:59:16,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:59:16,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:59:16,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:59:16,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:59:16,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:59:16,331 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:59:16,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2022-12-05 22:59:17,258 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:59:17,423 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:59:17,423 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2022-12-05 22:59:17,468 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9d91eeb/ae6891ff97794250bcfdca2d899c4e9c/FLAG6d7672abd [2022-12-05 22:59:17,482 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9d91eeb/ae6891ff97794250bcfdca2d899c4e9c [2022-12-05 22:59:17,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:59:17,484 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:59:17,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:59:17,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:59:17,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:59:17,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@810e1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17, skipping insertion in model container [2022-12-05 22:59:17,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:59:17,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:59:17,630 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/mix031.opt.i[987,1000] [2022-12-05 22:59:17,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:59:17,734 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:59:17,742 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/mix031.opt.i[987,1000] [2022-12-05 22:59:17,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:59:17,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:59:17,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:59:17,808 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:59:17,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17 WrapperNode [2022-12-05 22:59:17,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:59:17,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:59:17,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:59:17,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:59:17,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,846 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2022-12-05 22:59:17,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:59:17,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:59:17,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:59:17,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:59:17,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,878 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:59:17,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:59:17,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:59:17,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:59:17,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (1/1) ... [2022-12-05 22:59:17,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:59:17,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:59:17,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 22:59:17,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 22:59:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:59:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:59:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:59:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:59:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:59:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:59:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:59:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:59:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:59:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:59:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:59:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:59:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:59:17,951 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:59:18,049 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:59:18,050 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:59:18,312 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:59:18,415 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:59:18,416 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:59:18,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:59:18 BoogieIcfgContainer [2022-12-05 22:59:18,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:59:18,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:59:18,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:59:18,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:59:18,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:59:17" (1/3) ... [2022-12-05 22:59:18,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ec3052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:59:18, skipping insertion in model container [2022-12-05 22:59:18,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:59:17" (2/3) ... [2022-12-05 22:59:18,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ec3052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:59:18, skipping insertion in model container [2022-12-05 22:59:18,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:59:18" (3/3) ... [2022-12-05 22:59:18,424 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2022-12-05 22:59:18,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:59:18,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:59:18,437 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:59:18,464 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:59:18,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2022-12-05 22:59:18,538 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2022-12-05 22:59:18,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:59:18,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-05 22:59:18,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2022-12-05 22:59:18,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2022-12-05 22:59:18,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:18,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2022-12-05 22:59:18,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2022-12-05 22:59:18,606 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2022-12-05 22:59:18,607 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:59:18,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-05 22:59:18,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2022-12-05 22:59:18,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-05 22:59:21,881 INFO L203 LiptonReduction]: Total number of compositions: 75 [2022-12-05 22:59:21,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:59:21,896 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;@425842e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:59:21,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 22:59:21,898 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 22:59:21,898 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:59:21,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:21,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 22:59:21,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash 398091414, now seen corresponding path program 1 times [2022-12-05 22:59:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:21,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602585398] [2022-12-05 22:59:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:22,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602585398] [2022-12-05 22:59:22,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602585398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:22,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:22,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:59:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997577553] [2022-12-05 22:59:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:22,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:59:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:59:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:59:22,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 22:59:22,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:22,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:22,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 22:59:22,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:22,217 INFO L130 PetriNetUnfolder]: 173/328 cut-off events. [2022-12-05 22:59:22,218 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:59:22,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 328 events. 173/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1387 event pairs, 21 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 634. Up to 249 conditions per place. [2022-12-05 22:59:22,220 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 18 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-05 22:59:22,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 106 flow [2022-12-05 22:59:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:59:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:59:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 22:59:22,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 22:59:22,229 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 35 transitions. [2022-12-05 22:59:22,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 106 flow [2022-12-05 22:59:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:59:22,232 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-05 22:59:22,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-05 22:59:22,235 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 22:59:22,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:22,236 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 40 flow [2022-12-05 22:59:22,237 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:22,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:22,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2022-12-05 22:59:22,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-05 22:59:22,242 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-05 22:59:22,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:59:22,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:59:22,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-05 22:59:22,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 22:59:22,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:59:22,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-05 22:59:22,410 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-05 22:59:22,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:22,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:22,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:22,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:59:22,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash 313800199, now seen corresponding path program 1 times [2022-12-05 22:59:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:22,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370711245] [2022-12-05 22:59:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:22,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370711245] [2022-12-05 22:59:22,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370711245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:22,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:22,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:59:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288695305] [2022-12-05 22:59:22,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:22,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:59:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:22,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:59:22,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:59:22,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:59:22,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:22,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:22,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:59:22,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:22,640 INFO L130 PetriNetUnfolder]: 140/249 cut-off events. [2022-12-05 22:59:22,640 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 22:59:22,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 249 events. 140/249 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 804 event pairs, 56 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 522. Up to 235 conditions per place. [2022-12-05 22:59:22,647 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-05 22:59:22,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 100 flow [2022-12-05 22:59:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:59:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:59:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-05 22:59:22,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-05 22:59:22,649 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 23 transitions. [2022-12-05 22:59:22,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 100 flow [2022-12-05 22:59:22,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:59:22,650 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-05 22:59:22,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-05 22:59:22,651 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -4 predicate places. [2022-12-05 22:59:22,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:22,651 INFO L89 Accepts]: Start accepts. Operand has 23 places, 17 transitions, 53 flow [2022-12-05 22:59:22,651 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:22,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:22,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-05 22:59:22,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 17 transitions, 53 flow [2022-12-05 22:59:22,659 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-05 22:59:22,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:59:22,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2022-12-05 22:59:22,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 17 transitions, 53 flow [2022-12-05 22:59:22,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 22:59:22,682 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:59:22,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-05 22:59:22,684 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-05 22:59:22,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:22,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:22,685 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:59:22,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1137872989, now seen corresponding path program 1 times [2022-12-05 22:59:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369466793] [2022-12-05 22:59:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:22,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369466793] [2022-12-05 22:59:22,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369466793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:22,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:22,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:59:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049205314] [2022-12-05 22:59:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:59:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:59:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:59:22,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 22:59:22,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:22,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:22,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 22:59:22,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:22,880 INFO L130 PetriNetUnfolder]: 126/227 cut-off events. [2022-12-05 22:59:22,883 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-05 22:59:22,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 227 events. 126/227 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 705 event pairs, 78 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 521. Up to 161 conditions per place. [2022-12-05 22:59:22,885 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2022-12-05 22:59:22,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 117 flow [2022-12-05 22:59:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:59:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:59:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-05 22:59:22,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 22:59:22,886 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 24 transitions. [2022-12-05 22:59:22,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 117 flow [2022-12-05 22:59:22,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:59:22,887 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 61 flow [2022-12-05 22:59:22,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:59:22,888 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 22:59:22,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:22,888 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 61 flow [2022-12-05 22:59:22,888 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:22,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:22,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 61 flow [2022-12-05 22:59:22,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 61 flow [2022-12-05 22:59:22,892 INFO L130 PetriNetUnfolder]: 2/25 cut-off events. [2022-12-05 22:59:22,892 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-05 22:59:22,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 25 events. 2/25 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 38. Up to 8 conditions per place. [2022-12-05 22:59:22,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 61 flow [2022-12-05 22:59:22,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 22:59:22,904 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:59:22,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-05 22:59:22,904 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 61 flow [2022-12-05 22:59:22,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:22,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:22,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:22,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:59:22,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1399235952, now seen corresponding path program 1 times [2022-12-05 22:59:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:22,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538925619] [2022-12-05 22:59:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:23,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:23,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538925619] [2022-12-05 22:59:23,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538925619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:23,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:23,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:59:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176438723] [2022-12-05 22:59:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:23,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:59:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:59:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:59:23,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-05 22:59:23,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:23,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:23,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-05 22:59:23,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:23,044 INFO L130 PetriNetUnfolder]: 84/176 cut-off events. [2022-12-05 22:59:23,045 INFO L131 PetriNetUnfolder]: For 43/44 co-relation queries the response was YES. [2022-12-05 22:59:23,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 176 events. 84/176 cut-off events. For 43/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 629 event pairs, 18 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 384. Up to 124 conditions per place. [2022-12-05 22:59:23,046 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 16 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-05 22:59:23,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 109 flow [2022-12-05 22:59:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:59:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:59:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 22:59:23,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 22:59:23,047 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 61 flow. Second operand 3 states and 25 transitions. [2022-12-05 22:59:23,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 109 flow [2022-12-05 22:59:23,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 103 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:59:23,047 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 66 flow [2022-12-05 22:59:23,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-12-05 22:59:23,048 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2022-12-05 22:59:23,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:23,048 INFO L89 Accepts]: Start accepts. Operand has 26 places, 17 transitions, 66 flow [2022-12-05 22:59:23,049 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:23,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:23,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 66 flow [2022-12-05 22:59:23,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 66 flow [2022-12-05 22:59:23,051 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2022-12-05 22:59:23,051 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-12-05 22:59:23,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 20 events. 1/20 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-05 22:59:23,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 66 flow [2022-12-05 22:59:23,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-05 22:59:23,054 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:59:23,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:59:23,055 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 66 flow [2022-12-05 22:59:23,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:23,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:23,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:23,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:59:23,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash -993120810, now seen corresponding path program 1 times [2022-12-05 22:59:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:23,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620888114] [2022-12-05 22:59:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:23,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620888114] [2022-12-05 22:59:23,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620888114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:23,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:23,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:59:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275988228] [2022-12-05 22:59:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:23,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:59:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:59:23,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:59:23,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-05 22:59:23,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:23,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:23,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-05 22:59:23,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:23,207 INFO L130 PetriNetUnfolder]: 51/125 cut-off events. [2022-12-05 22:59:23,207 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-12-05 22:59:23,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 125 events. 51/125 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 432 event pairs, 11 based on Foata normal form. 19/143 useless extension candidates. Maximal degree in co-relation 304. Up to 55 conditions per place. [2022-12-05 22:59:23,208 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 23 selfloop transitions, 5 changer transitions 8/39 dead transitions. [2022-12-05 22:59:23,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 204 flow [2022-12-05 22:59:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:59:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:59:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-05 22:59:23,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-05 22:59:23,209 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 66 flow. Second operand 5 states and 46 transitions. [2022-12-05 22:59:23,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 204 flow [2022-12-05 22:59:23,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:59:23,210 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 97 flow [2022-12-05 22:59:23,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-05 22:59:23,211 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2022-12-05 22:59:23,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:23,211 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 97 flow [2022-12-05 22:59:23,211 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:23,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:23,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 97 flow [2022-12-05 22:59:23,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 97 flow [2022-12-05 22:59:23,215 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-05 22:59:23,215 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-05 22:59:23,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 35 events. 3/35 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 84. Up to 12 conditions per place. [2022-12-05 22:59:23,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 97 flow [2022-12-05 22:59:23,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-05 22:59:23,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L826-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_28 256)) (= v_~main$tmp_guard0~0_28 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_59) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [386] L806-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_99 (+ v_~__unbuffered_cnt~0_100 1)) (= |v_P1Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] [2022-12-05 22:59:23,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:59:23,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-05 22:59:23,280 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 95 flow [2022-12-05 22:59:23,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:23,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:23,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:23,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:59:23,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash -370890023, now seen corresponding path program 1 times [2022-12-05 22:59:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:23,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387844373] [2022-12-05 22:59:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:23,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387844373] [2022-12-05 22:59:23,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387844373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:23,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:23,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:59:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390523434] [2022-12-05 22:59:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:23,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:59:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:59:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:59:23,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-05 22:59:23,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:23,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:23,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-05 22:59:23,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:23,445 INFO L130 PetriNetUnfolder]: 23/73 cut-off events. [2022-12-05 22:59:23,445 INFO L131 PetriNetUnfolder]: For 48/49 co-relation queries the response was YES. [2022-12-05 22:59:23,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 73 events. 23/73 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 196 event pairs, 8 based on Foata normal form. 8/80 useless extension candidates. Maximal degree in co-relation 216. Up to 26 conditions per place. [2022-12-05 22:59:23,445 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 18 selfloop transitions, 7 changer transitions 5/33 dead transitions. [2022-12-05 22:59:23,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 197 flow [2022-12-05 22:59:23,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:59:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:59:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-05 22:59:23,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2022-12-05 22:59:23,447 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 95 flow. Second operand 6 states and 43 transitions. [2022-12-05 22:59:23,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 197 flow [2022-12-05 22:59:23,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 181 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 22:59:23,450 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 112 flow [2022-12-05 22:59:23,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-05 22:59:23,451 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-05 22:59:23,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:23,452 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 112 flow [2022-12-05 22:59:23,453 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:23,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:23,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 112 flow [2022-12-05 22:59:23,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 112 flow [2022-12-05 22:59:23,457 INFO L130 PetriNetUnfolder]: 2/27 cut-off events. [2022-12-05 22:59:23,457 INFO L131 PetriNetUnfolder]: For 41/42 co-relation queries the response was YES. [2022-12-05 22:59:23,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 27 events. 2/27 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 71. Up to 11 conditions per place. [2022-12-05 22:59:23,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 112 flow [2022-12-05 22:59:23,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-05 22:59:23,793 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:59:23,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 342 [2022-12-05 22:59:23,794 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 89 flow [2022-12-05 22:59:23,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:23,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:23,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:23,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:59:23,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1344797798, now seen corresponding path program 1 times [2022-12-05 22:59:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:23,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773196054] [2022-12-05 22:59:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:24,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773196054] [2022-12-05 22:59:24,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773196054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:24,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:24,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:59:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32716561] [2022-12-05 22:59:24,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:24,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:59:24,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:59:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:59:24,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:59:24,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 89 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:24,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:24,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:59:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:24,131 INFO L130 PetriNetUnfolder]: 36/94 cut-off events. [2022-12-05 22:59:24,132 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-05 22:59:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 94 events. 36/94 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 295 event pairs, 0 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 283. Up to 50 conditions per place. [2022-12-05 22:59:24,132 INFO L137 encePairwiseOnDemand]: 5/13 looper letters, 21 selfloop transitions, 16 changer transitions 5/42 dead transitions. [2022-12-05 22:59:24,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 277 flow [2022-12-05 22:59:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:59:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:59:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-12-05 22:59:24,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4175824175824176 [2022-12-05 22:59:24,133 INFO L175 Difference]: Start difference. First operand has 31 places, 17 transitions, 89 flow. Second operand 7 states and 38 transitions. [2022-12-05 22:59:24,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 277 flow [2022-12-05 22:59:24,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 236 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-05 22:59:24,135 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 157 flow [2022-12-05 22:59:24,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-05 22:59:24,135 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-05 22:59:24,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:24,135 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 157 flow [2022-12-05 22:59:24,136 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:24,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:24,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 157 flow [2022-12-05 22:59:24,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 157 flow [2022-12-05 22:59:24,142 INFO L130 PetriNetUnfolder]: 14/56 cut-off events. [2022-12-05 22:59:24,142 INFO L131 PetriNetUnfolder]: For 41/44 co-relation queries the response was YES. [2022-12-05 22:59:24,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 56 events. 14/56 cut-off events. For 41/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 177 event pairs, 0 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 152. Up to 14 conditions per place. [2022-12-05 22:59:24,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 157 flow [2022-12-05 22:59:24,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-05 22:59:24,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L796-->L799: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] and [283] L751-->L754: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-05 22:59:24,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L796-->L799: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] and [284] L754-->L770: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd1~0_36 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd1~0_36 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse6 .cse9)) (.cse8 (and (= (mod v_~y$w_buff1_used~0_77 256) 0) .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_90 256) 0))) (let ((.cse0 (or .cse7 .cse8 .cse11)) (.cse1 (and (not .cse11) .cse10)) (.cse4 (= (mod v_~y$w_buff1_used~0_76 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_89 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= 0 v_~y$flush_delayed~0_25) (= v_~__unbuffered_p0_EBX~0_10 (ite .cse0 v_~y~0_59 (ite .cse1 v_~y$w_buff0~0_52 v_~y$w_buff1~0_43))) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse2 v_~y$r_buff1_thd1~0_36 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd1~0_35 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse6 .cse5))) v_~y$r_buff1_thd1~0_36 0)) v_~y$r_buff1_thd1~0_35) (= v_~y~0_59 v_~y$mem_tmp~0_12) (= v_~y$w_buff0_used~0_89 (ite .cse2 v_~y$w_buff0_used~0_90 (ite .cse0 v_~y$w_buff0_used~0_90 (ite .cse1 0 v_~y$w_buff0_used~0_90)))) (= v_~y$w_buff1_used~0_76 (ite .cse2 v_~y$w_buff1_used~0_77 (ite (or .cse3 .cse7 .cse8) v_~y$w_buff1_used~0_77 0))) (= v_~y$r_buff0_thd1~0_35 (ite .cse2 v_~y$r_buff0_thd1~0_36 (ite (or .cse3 .cse7 (and .cse4 .cse9)) v_~y$r_buff0_thd1~0_36 (ite (and (not .cse3) .cse10) 0 v_~y$r_buff0_thd1~0_36)))) (= (ite .cse2 v_~y$mem_tmp~0_12 v_~__unbuffered_p0_EBX~0_10) v_~y~0_58) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~y$w_buff1~0_43 v_~y$w_buff1~0_42) (= v_~y$w_buff0~0_52 v_~y$w_buff0~0_51))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_90, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_10, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_35, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~y$w_buff1~0=v_~y$w_buff1~0_42, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_35, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-05 22:59:24,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:59:24,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-05 22:59:24,353 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 159 flow [2022-12-05 22:59:24,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:24,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:24,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:24,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:59:24,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1321425114, now seen corresponding path program 1 times [2022-12-05 22:59:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721300196] [2022-12-05 22:59:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721300196] [2022-12-05 22:59:24,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721300196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:24,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:24,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:59:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876389678] [2022-12-05 22:59:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:24,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:59:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:59:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:59:24,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 22:59:24,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 159 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:24,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:24,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 22:59:24,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:24,554 INFO L130 PetriNetUnfolder]: 38/101 cut-off events. [2022-12-05 22:59:24,554 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2022-12-05 22:59:24,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 101 events. 38/101 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 3 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 379. Up to 47 conditions per place. [2022-12-05 22:59:24,555 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 14 selfloop transitions, 3 changer transitions 23/40 dead transitions. [2022-12-05 22:59:24,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 298 flow [2022-12-05 22:59:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:59:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:59:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-12-05 22:59:24,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-05 22:59:24,556 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 159 flow. Second operand 6 states and 33 transitions. [2022-12-05 22:59:24,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 298 flow [2022-12-05 22:59:24,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 22:59:24,558 INFO L231 Difference]: Finished difference. Result has 38 places, 15 transitions, 86 flow [2022-12-05 22:59:24,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=15} [2022-12-05 22:59:24,558 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-05 22:59:24,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:24,558 INFO L89 Accepts]: Start accepts. Operand has 38 places, 15 transitions, 86 flow [2022-12-05 22:59:24,559 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:24,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:24,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 15 transitions, 86 flow [2022-12-05 22:59:24,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 15 transitions, 86 flow [2022-12-05 22:59:24,562 INFO L130 PetriNetUnfolder]: 2/22 cut-off events. [2022-12-05 22:59:24,562 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-05 22:59:24,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 22 events. 2/22 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 1 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2022-12-05 22:59:24,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 15 transitions, 86 flow [2022-12-05 22:59:24,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-05 22:59:24,669 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:59:24,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-05 22:59:24,670 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 13 transitions, 80 flow [2022-12-05 22:59:24,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:24,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:24,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:24,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:59:24,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash -198656889, now seen corresponding path program 1 times [2022-12-05 22:59:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:24,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696730519] [2022-12-05 22:59:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:59:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:59:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:59:25,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696730519] [2022-12-05 22:59:25,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696730519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:59:25,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:59:25,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:59:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910196828] [2022-12-05 22:59:25,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:59:25,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:59:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:59:25,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:59:25,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:59:25,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-05 22:59:25,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 13 transitions, 80 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:25,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:59:25,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-05 22:59:25,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:59:25,106 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-05 22:59:25,106 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-05 22:59:25,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 27 events. 6/27 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 107. Up to 12 conditions per place. [2022-12-05 22:59:25,106 INFO L137 encePairwiseOnDemand]: 6/11 looper letters, 10 selfloop transitions, 4 changer transitions 6/20 dead transitions. [2022-12-05 22:59:25,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 20 transitions, 162 flow [2022-12-05 22:59:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:59:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:59:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-12-05 22:59:25,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25757575757575757 [2022-12-05 22:59:25,107 INFO L175 Difference]: Start difference. First operand has 32 places, 13 transitions, 80 flow. Second operand 6 states and 17 transitions. [2022-12-05 22:59:25,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 20 transitions, 162 flow [2022-12-05 22:59:25,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 20 transitions, 132 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-05 22:59:25,108 INFO L231 Difference]: Finished difference. Result has 30 places, 13 transitions, 70 flow [2022-12-05 22:59:25,108 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=13} [2022-12-05 22:59:25,109 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-05 22:59:25,109 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:59:25,109 INFO L89 Accepts]: Start accepts. Operand has 30 places, 13 transitions, 70 flow [2022-12-05 22:59:25,109 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:59:25,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:59:25,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 13 transitions, 70 flow [2022-12-05 22:59:25,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 13 transitions, 70 flow [2022-12-05 22:59:25,112 INFO L130 PetriNetUnfolder]: 2/18 cut-off events. [2022-12-05 22:59:25,112 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-05 22:59:25,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 18 events. 2/18 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 1 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 46. Up to 6 conditions per place. [2022-12-05 22:59:25,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 13 transitions, 70 flow [2022-12-05 22:59:25,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-05 22:59:25,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L799-->P1EXIT: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_117 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_366 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_173 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_367 256) 0)) .cse5)) (.cse3 (and .cse5 .cse2)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_315 256) 0)) .cse1))) (and (= v_~y$w_buff0_used~0_366 (ite .cse0 0 v_~y$w_buff0_used~0_367)) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_314 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_172 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_117) v_~y$r_buff1_thd2~0_116) (= (ite .cse3 0 v_~y$r_buff0_thd2~0_173) v_~y$r_buff0_thd2~0_172) (= v_~y~0_262 (ite .cse0 v_~y$w_buff0~0_259 (ite .cse4 v_~y$w_buff1~0_212 v_~y~0_263))) (= |v_P1Thread1of1ForFork1_#res#1.offset_17| 0) (= v_~y$w_buff1_used~0_314 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_315)) (= v_~__unbuffered_cnt~0_129 (+ v_~__unbuffered_cnt~0_130 1)) (= |v_P1Thread1of1ForFork1_#res#1.base_17| 0)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_117, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_367, ~y$w_buff1~0=v_~y$w_buff1~0_212, ~y$w_buff0~0=v_~y$w_buff0~0_259, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_173, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~y~0=v_~y~0_263, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_315} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_116, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, ~y$w_buff1~0=v_~y$w_buff1~0_212, ~y$w_buff0~0=v_~y$w_buff0~0_259, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~y~0=v_~y~0_262, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_314} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res#1.base, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res#1.offset, ~y$w_buff1_used~0] and [395] L826-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_350 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_151 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_147 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_351 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_301 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= (mod v_~main$tmp_guard1~0_95 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_80|) (= v_~y~0_250 (ite .cse0 v_~y$w_buff0~0_247 (ite .cse1 v_~y$w_buff1~0_202 v_~y~0_251))) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_56) (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_70|) (= v_~y$w_buff0_used~0_350 (ite .cse0 0 v_~y$w_buff0_used~0_351)) (= v_~y$w_buff1_used~0_300 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_301)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_92| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_80| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_92|) (= v_~main$tmp_guard1~0_95 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_111 1) (= v_~__unbuffered_p1_EBX~0_92 0) (= v_~__unbuffered_p0_EBX~0_124 0) (= v_~__unbuffered_p0_EAX~0_89 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_66| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_70|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_66| 0)) (= v_~y$r_buff1_thd0~0_150 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_146 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_300 256) 0)))) 0 v_~y$r_buff1_thd0~0_151)) (= (ite .cse2 0 v_~y$r_buff0_thd0~0_147) v_~y$r_buff0_thd0~0_146)))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_124, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_351, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_202, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_147, ~y$w_buff0~0=v_~y$w_buff0~0_247, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_251, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_151, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_301} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_92|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_124, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_80|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_202, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$w_buff0~0=v_~y$w_buff0~0_247, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_66|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_57|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_55|, ~y~0=v_~y~0_250, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_300, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_70|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 22:59:25,976 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:59:25,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 868 [2022-12-05 22:59:25,977 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 12 transitions, 86 flow [2022-12-05 22:59:25,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:59:25,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:59:25,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:25,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:59:25,977 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 22:59:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:59:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash -463917175, now seen corresponding path program 1 times [2022-12-05 22:59:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:59:25,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515531182] [2022-12-05 22:59:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:59:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:59:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:59:25,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:59:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:59:26,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:59:26,026 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:59:26,026 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 22:59:26,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 22:59:26,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 22:59:26,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 22:59:26,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 22:59:26,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:59:26,028 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:59:26,031 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:59:26,031 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:59:26,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:59:26 BasicIcfg [2022-12-05 22:59:26,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:59:26,058 INFO L158 Benchmark]: Toolchain (without parser) took 8573.31ms. Allocated memory was 222.3MB in the beginning and 386.9MB in the end (delta: 164.6MB). Free memory was 187.2MB in the beginning and 146.2MB in the end (delta: 41.0MB). Peak memory consumption was 207.0MB. Max. memory is 8.0GB. [2022-12-05 22:59:26,058 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 222.3MB. Free memory was 199.7MB in the beginning and 199.5MB in the end (delta: 150.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:59:26,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.32ms. Allocated memory is still 222.3MB. Free memory was 187.2MB in the beginning and 161.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 22:59:26,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.57ms. Allocated memory is still 222.3MB. Free memory was 161.8MB in the beginning and 159.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:59:26,058 INFO L158 Benchmark]: Boogie Preprocessor took 51.63ms. Allocated memory is still 222.3MB. Free memory was 159.3MB in the beginning and 157.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 22:59:26,058 INFO L158 Benchmark]: RCFGBuilder took 518.32ms. Allocated memory is still 222.3MB. Free memory was 157.6MB in the beginning and 193.8MB in the end (delta: -36.2MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2022-12-05 22:59:26,059 INFO L158 Benchmark]: TraceAbstraction took 7638.34ms. Allocated memory was 222.3MB in the beginning and 386.9MB in the end (delta: 164.6MB). Free memory was 193.3MB in the beginning and 146.2MB in the end (delta: 47.1MB). Peak memory consumption was 211.7MB. Max. memory is 8.0GB. [2022-12-05 22:59:26,059 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 222.3MB. Free memory was 199.7MB in the beginning and 199.5MB in the end (delta: 150.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.32ms. Allocated memory is still 222.3MB. Free memory was 187.2MB in the beginning and 161.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.57ms. Allocated memory is still 222.3MB. Free memory was 161.8MB in the beginning and 159.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.63ms. Allocated memory is still 222.3MB. Free memory was 159.3MB in the beginning and 157.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 518.32ms. Allocated memory is still 222.3MB. Free memory was 157.6MB in the beginning and 193.8MB in the end (delta: -36.2MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. * TraceAbstraction took 7638.34ms. Allocated memory was 222.3MB in the beginning and 386.9MB in the end (delta: 164.6MB). Free memory was 193.3MB in the beginning and 146.2MB in the end (delta: 47.1MB). Peak memory consumption was 211.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 98 PlacesBefore, 27 PlacesAfterwards, 93 TransitionsBefore, 21 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 34 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1053, independent: 1007, independent conditional: 1007, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1053, independent: 1007, independent conditional: 0, independent unconditional: 1007, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1053, independent: 1007, independent conditional: 0, independent unconditional: 1007, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1053, independent: 1007, independent conditional: 0, independent unconditional: 1007, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 840, independent: 803, independent conditional: 0, independent unconditional: 803, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 840, independent: 794, independent conditional: 0, independent unconditional: 794, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1053, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 840, unknown conditional: 0, unknown unconditional: 840] , Statistics on independence cache: Total cache size (in pairs): 1365, Positive cache size: 1328, Positive conditional cache size: 0, Positive unconditional cache size: 1328, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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, 23 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 90, independent conditional: 16, independent unconditional: 74, dependent: 33, dependent conditional: 11, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 90, independent conditional: 16, independent unconditional: 74, dependent: 33, dependent conditional: 11, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 90, independent conditional: 16, independent unconditional: 74, dependent: 33, dependent conditional: 11, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, independent: 53, independent conditional: 12, independent unconditional: 41, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 74, dependent conditional: 53, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 69, unknown conditional: 19, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 53, Positive conditional cache size: 12, Positive unconditional cache size: 41, Negative cache size: 16, Negative conditional cache size: 7, Negative unconditional cache size: 9, 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, 23 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 43, independent conditional: 43, 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: 56, independent: 43, independent conditional: 4, independent unconditional: 39, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 43, independent conditional: 0, independent unconditional: 43, 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: 56, independent: 43, independent conditional: 0, independent unconditional: 43, 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: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 62, Positive conditional cache size: 12, Positive unconditional cache size: 50, Negative cache size: 20, Negative conditional cache size: 7, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 28, independent conditional: 28, 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: 41, independent: 28, independent conditional: 6, independent unconditional: 22, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 41, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 68, Positive conditional cache size: 12, Positive unconditional cache size: 56, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 29, independent conditional: 29, 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: 43, independent: 29, independent conditional: 7, independent unconditional: 22, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 45, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 45, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 68, Positive conditional cache size: 12, Positive unconditional cache size: 56, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 66, independent conditional: 32, independent unconditional: 34, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 66, independent conditional: 26, independent unconditional: 40, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 66, independent conditional: 26, independent unconditional: 40, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 66, independent conditional: 26, independent unconditional: 40, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 72, Positive conditional cache size: 12, Positive unconditional cache size: 60, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 17 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 44, independent conditional: 13, independent unconditional: 31, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 44, independent conditional: 9, independent unconditional: 35, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 44, independent conditional: 9, independent unconditional: 35, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 42, independent conditional: 7, independent unconditional: 35, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 79, Positive conditional cache size: 14, Positive unconditional cache size: 65, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 83, Positive conditional cache size: 15, Positive unconditional cache size: 68, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 34 PlacesBefore, 32 PlacesAfterwards, 15 TransitionsBefore, 13 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 8, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 101, Positive conditional cache size: 20, Positive unconditional cache size: 81, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 29 PlacesBefore, 28 PlacesAfterwards, 13 TransitionsBefore, 12 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 117, Positive conditional cache size: 21, Positive unconditional cache size: 96, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_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_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835, ((void *)0), P0, ((void *)0))=-1, t835={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836, ((void *)0), P1, ((void *)0))=0, t835={5:0}, t836={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 [L792] 2 z = 1 [L795] 2 __unbuffered_p1_EAX = z [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L747] 1 a = 1 [L750] 1 x = 1 [L753] 1 __unbuffered_p0_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 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 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 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 [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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 5 procedures, 116 locations, 5 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: 7.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 11 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 22:59:26,076 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...