/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:36:30,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:36:30,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:36:30,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:36:30,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:36:30,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:36:30,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:36:30,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:36:30,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:36:30,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:36:30,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:36:30,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:36:30,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:36:30,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:36:30,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:36:30,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:36:30,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:36:30,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:36:30,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:36:30,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:36:30,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:36:30,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:36:30,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:36:30,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:36:30,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:36:30,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:36:30,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:36:30,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:36:30,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:36:30,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:36:30,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:36:30,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:36:30,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:36:30,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:36:30,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:36:30,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:36:30,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:36:30,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:36:30,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:36:30,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:36:30,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:36:30,759 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-SemanticLbe.epf [2022-12-12 21:36:30,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:36:30,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:36:30,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:36:30,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:36:30,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:36:30,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:36:30,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:36:30,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:36:30,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:36:30,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:30,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:36:30,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:36:30,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:36:30,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:36:30,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:36:30,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:36:30,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:36:31,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:36:31,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:36:31,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:36:31,067 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:36:31,068 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:36:31,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2022-12-12 21:36:32,039 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:36:32,291 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:36:32,291 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2022-12-12 21:36:32,308 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc795ccf8/3d0dd6021709467bbde423ab06490dfc/FLAGbca7e7ffe [2022-12-12 21:36:32,322 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc795ccf8/3d0dd6021709467bbde423ab06490dfc [2022-12-12 21:36:32,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:36:32,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:36:32,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:32,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:36:32,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:36:32,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be67b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32, skipping insertion in model container [2022-12-12 21:36:32,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:36:32,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:36:32,550 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/mix033_tso.oepc.i[949,962] [2022-12-12 21:36:32,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:32,688 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:36:32,700 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/mix033_tso.oepc.i[949,962] [2022-12-12 21:36:32,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:32,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:32,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:32,791 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:36:32,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32 WrapperNode [2022-12-12 21:36:32,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:32,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:32,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:36:32,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:36:32,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,831 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2022-12-12 21:36:32,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:32,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:36:32,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:36:32,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:36:32,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,856 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:36:32,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:36:32,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:36:32,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:36:32,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (1/1) ... [2022-12-12 21:36:32,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:32,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:36:32,913 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-12 21:36:32,920 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-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:36:32,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:36:32,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:36:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:36:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:36:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:36:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:36:32,941 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:36:33,067 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:36:33,068 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:36:33,332 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:36:33,431 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:36:33,431 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:36:33,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:33 BoogieIcfgContainer [2022-12-12 21:36:33,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:36:33,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:36:33,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:36:33,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:36:33,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:36:32" (1/3) ... [2022-12-12 21:36:33,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a72154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:33, skipping insertion in model container [2022-12-12 21:36:33,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:32" (2/3) ... [2022-12-12 21:36:33,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a72154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:33, skipping insertion in model container [2022-12-12 21:36:33,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:33" (3/3) ... [2022-12-12 21:36:33,439 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2022-12-12 21:36:33,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:36:33,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:36:33,453 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:36:33,492 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:36:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-12-12 21:36:33,575 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-12-12 21:36:33,576 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:33,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-12 21:36:33,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-12-12 21:36:33,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-12-12 21:36:33,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:36:33,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2022-12-12 21:36:33,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2022-12-12 21:36:33,644 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-12-12 21:36:33,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:33,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-12 21:36:33,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2022-12-12 21:36:33,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 2290 [2022-12-12 21:36:41,294 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-12 21:36:41,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:36:41,308 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=PETRI_NET, 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;@4b21afe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:36:41,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:36:41,311 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-12 21:36:41,311 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:41,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:41,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 21:36:41,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash 496284818, now seen corresponding path program 1 times [2022-12-12 21:36:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:41,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613336171] [2022-12-12 21:36:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:41,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:41,606 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-12 21:36:41,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:41,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613336171] [2022-12-12 21:36:41,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613336171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:41,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:41,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:36:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504212076] [2022-12-12 21:36:41,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:41,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:36:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:41,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:36:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:36:41,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 64 [2022-12-12 21:36:41,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-12 21:36:41,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:41,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 64 [2022-12-12 21:36:41,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:43,463 INFO L130 PetriNetUnfolder]: 11667/18480 cut-off events. [2022-12-12 21:36:43,463 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-12 21:36:43,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35095 conditions, 18480 events. 11667/18480 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 138094 event pairs, 2447 based on Foata normal form. 0/10115 useless extension candidates. Maximal degree in co-relation 35084. Up to 14441 conditions per place. [2022-12-12 21:36:43,513 INFO L137 encePairwiseOnDemand]: 59/64 looper letters, 34 selfloop transitions, 3 changer transitions 52/102 dead transitions. [2022-12-12 21:36:43,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 394 flow [2022-12-12 21:36:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-12-12 21:36:43,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2022-12-12 21:36:43,527 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2022-12-12 21:36:43,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 102 transitions, 394 flow [2022-12-12 21:36:43,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 50 transitions, 186 flow [2022-12-12 21:36:43,558 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 186 flow [2022-12-12 21:36:43,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-12 21:36:43,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:43,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:43,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:36:43,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash 604811701, now seen corresponding path program 1 times [2022-12-12 21:36:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:43,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918927688] [2022-12-12 21:36:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:43,979 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-12 21:36:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:43,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918927688] [2022-12-12 21:36:43,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918927688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:43,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:43,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:36:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178812004] [2022-12-12 21:36:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:43,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:43,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 64 [2022-12-12 21:36:43,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:43,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:43,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 64 [2022-12-12 21:36:43,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:44,457 INFO L130 PetriNetUnfolder]: 3369/5097 cut-off events. [2022-12-12 21:36:44,457 INFO L131 PetriNetUnfolder]: For 841/841 co-relation queries the response was YES. [2022-12-12 21:36:44,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13995 conditions, 5097 events. 3369/5097 cut-off events. For 841/841 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 26378 event pairs, 353 based on Foata normal form. 144/4283 useless extension candidates. Maximal degree in co-relation 13981. Up to 3521 conditions per place. [2022-12-12 21:36:44,481 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 58 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2022-12-12 21:36:44,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 384 flow [2022-12-12 21:36:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-12 21:36:44,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2022-12-12 21:36:44,483 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -24 predicate places. [2022-12-12 21:36:44,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 70 transitions, 384 flow [2022-12-12 21:36:44,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 68 transitions, 372 flow [2022-12-12 21:36:44,502 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 68 transitions, 372 flow [2022-12-12 21:36:44,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:44,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:44,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:44,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:36:44,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1402861069, now seen corresponding path program 1 times [2022-12-12 21:36:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:44,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264722597] [2022-12-12 21:36:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:44,675 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-12 21:36:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264722597] [2022-12-12 21:36:44,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264722597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:44,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:44,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:36:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699076276] [2022-12-12 21:36:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:44,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:36:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:36:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:36:44,680 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:36:44,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 68 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-12 21:36:44,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:44,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:36:44,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:45,044 INFO L130 PetriNetUnfolder]: 2790/4271 cut-off events. [2022-12-12 21:36:45,044 INFO L131 PetriNetUnfolder]: For 2236/2236 co-relation queries the response was YES. [2022-12-12 21:36:45,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15027 conditions, 4271 events. 2790/4271 cut-off events. For 2236/2236 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 21609 event pairs, 233 based on Foata normal form. 90/3670 useless extension candidates. Maximal degree in co-relation 15010. Up to 2946 conditions per place. [2022-12-12 21:36:45,067 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 66 selfloop transitions, 3 changer transitions 2/85 dead transitions. [2022-12-12 21:36:45,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 619 flow [2022-12-12 21:36:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-12 21:36:45,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 21:36:45,069 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -23 predicate places. [2022-12-12 21:36:45,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 85 transitions, 619 flow [2022-12-12 21:36:45,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 83 transitions, 603 flow [2022-12-12 21:36:45,089 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 83 transitions, 603 flow [2022-12-12 21:36:45,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-12 21:36:45,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:45,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:45,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:36:45,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -467431678, now seen corresponding path program 1 times [2022-12-12 21:36:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:45,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841618405] [2022-12-12 21:36:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:45,480 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-12 21:36:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:45,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841618405] [2022-12-12 21:36:45,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841618405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:45,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:45,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271927810] [2022-12-12 21:36:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:45,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:45,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:36:45,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 83 transitions, 603 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-12 21:36:45,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:45,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:36:45,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:45,802 INFO L130 PetriNetUnfolder]: 2447/3761 cut-off events. [2022-12-12 21:36:45,802 INFO L131 PetriNetUnfolder]: For 4235/4235 co-relation queries the response was YES. [2022-12-12 21:36:45,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16169 conditions, 3761 events. 2447/3761 cut-off events. For 4235/4235 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 18759 event pairs, 125 based on Foata normal form. 8/3257 useless extension candidates. Maximal degree in co-relation 16149. Up to 2793 conditions per place. [2022-12-12 21:36:45,827 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 95 selfloop transitions, 12 changer transitions 0/121 dead transitions. [2022-12-12 21:36:45,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 121 transitions, 1117 flow [2022-12-12 21:36:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-12 21:36:45,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35546875 [2022-12-12 21:36:45,829 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2022-12-12 21:36:45,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 121 transitions, 1117 flow [2022-12-12 21:36:45,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 121 transitions, 1117 flow [2022-12-12 21:36:45,850 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 121 transitions, 1117 flow [2022-12-12 21:36:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-12 21:36:45,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:45,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:36:45,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash -920119749, now seen corresponding path program 1 times [2022-12-12 21:36:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:45,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66553472] [2022-12-12 21:36:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:46,090 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-12 21:36:46,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:46,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66553472] [2022-12-12 21:36:46,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66553472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:46,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:46,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25941841] [2022-12-12 21:36:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:46,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:46,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:46,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:36:46,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 121 transitions, 1117 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-12 21:36:46,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:46,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:36:46,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:46,481 INFO L130 PetriNetUnfolder]: 2939/4464 cut-off events. [2022-12-12 21:36:46,481 INFO L131 PetriNetUnfolder]: For 9670/9670 co-relation queries the response was YES. [2022-12-12 21:36:46,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22936 conditions, 4464 events. 2939/4464 cut-off events. For 9670/9670 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 22689 event pairs, 142 based on Foata normal form. 10/3899 useless extension candidates. Maximal degree in co-relation 22913. Up to 3374 conditions per place. [2022-12-12 21:36:46,513 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 145 selfloop transitions, 35 changer transitions 0/194 dead transitions. [2022-12-12 21:36:46,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 194 transitions, 2225 flow [2022-12-12 21:36:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:36:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:36:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-12 21:36:46,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.340625 [2022-12-12 21:36:46,516 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2022-12-12 21:36:46,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 194 transitions, 2225 flow [2022-12-12 21:36:46,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 194 transitions, 2225 flow [2022-12-12 21:36:46,544 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 194 transitions, 2225 flow [2022-12-12 21:36:46,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-12 21:36:46,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:46,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:46,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:36:46,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1436353921, now seen corresponding path program 2 times [2022-12-12 21:36:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:46,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967099819] [2022-12-12 21:36:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:46,875 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-12 21:36:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:46,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967099819] [2022-12-12 21:36:46,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967099819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:46,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:46,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770850237] [2022-12-12 21:36:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:46,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:46,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:46,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:36:46,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 194 transitions, 2225 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-12 21:36:46,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:46,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:36:46,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:47,315 INFO L130 PetriNetUnfolder]: 2954/4508 cut-off events. [2022-12-12 21:36:47,315 INFO L131 PetriNetUnfolder]: For 14585/14585 co-relation queries the response was YES. [2022-12-12 21:36:47,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26777 conditions, 4508 events. 2954/4508 cut-off events. For 14585/14585 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23239 event pairs, 140 based on Foata normal form. 50/3969 useless extension candidates. Maximal degree in co-relation 26751. Up to 3410 conditions per place. [2022-12-12 21:36:47,347 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 158 selfloop transitions, 46 changer transitions 0/218 dead transitions. [2022-12-12 21:36:47,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 218 transitions, 2917 flow [2022-12-12 21:36:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:36:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:36:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-12 21:36:47,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-12 21:36:47,350 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2022-12-12 21:36:47,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 218 transitions, 2917 flow [2022-12-12 21:36:47,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 218 transitions, 2917 flow [2022-12-12 21:36:47,377 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 218 transitions, 2917 flow [2022-12-12 21:36:47,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-12 21:36:47,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:47,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:47,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:36:47,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash 660069171, now seen corresponding path program 1 times [2022-12-12 21:36:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:47,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679447046] [2022-12-12 21:36:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:47,621 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-12 21:36:47,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:47,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679447046] [2022-12-12 21:36:47,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679447046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:47,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:47,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:36:47,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517181880] [2022-12-12 21:36:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:47,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:47,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:47,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 64 [2022-12-12 21:36:47,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 218 transitions, 2917 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12 21:36:47,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:47,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 64 [2022-12-12 21:36:47,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:48,409 INFO L130 PetriNetUnfolder]: 4195/6495 cut-off events. [2022-12-12 21:36:48,409 INFO L131 PetriNetUnfolder]: For 18818/18818 co-relation queries the response was YES. [2022-12-12 21:36:48,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45111 conditions, 6495 events. 4195/6495 cut-off events. For 18818/18818 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 36686 event pairs, 133 based on Foata normal form. 114/5653 useless extension candidates. Maximal degree in co-relation 45082. Up to 5078 conditions per place. [2022-12-12 21:36:48,449 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 272 selfloop transitions, 29 changer transitions 56/365 dead transitions. [2022-12-12 21:36:48,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 365 transitions, 5605 flow [2022-12-12 21:36:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:36:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:36:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-12 21:36:48,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3151041666666667 [2022-12-12 21:36:48,452 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2022-12-12 21:36:48,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 365 transitions, 5605 flow [2022-12-12 21:36:48,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 309 transitions, 4741 flow [2022-12-12 21:36:48,486 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 309 transitions, 4741 flow [2022-12-12 21:36:48,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-12 21:36:48,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:48,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:48,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:36:48,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 757585943, now seen corresponding path program 2 times [2022-12-12 21:36:48,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:48,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808407882] [2022-12-12 21:36:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:48,624 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-12 21:36:48,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:48,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808407882] [2022-12-12 21:36:48,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808407882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:48,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:48,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:36:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209542234] [2022-12-12 21:36:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:48,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:36:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:36:48,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:36:48,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 64 [2022-12-12 21:36:48,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 309 transitions, 4741 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:48,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:48,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 64 [2022-12-12 21:36:48,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:49,223 INFO L130 PetriNetUnfolder]: 3862/6290 cut-off events. [2022-12-12 21:36:49,224 INFO L131 PetriNetUnfolder]: For 33946/34241 co-relation queries the response was YES. [2022-12-12 21:36:49,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47022 conditions, 6290 events. 3862/6290 cut-off events. For 33946/34241 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 39658 event pairs, 289 based on Foata normal form. 182/5579 useless extension candidates. Maximal degree in co-relation 46990. Up to 5078 conditions per place. [2022-12-12 21:36:49,261 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 242 selfloop transitions, 54 changer transitions 10/331 dead transitions. [2022-12-12 21:36:49,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 331 transitions, 5686 flow [2022-12-12 21:36:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-12 21:36:49,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-12 21:36:49,262 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2022-12-12 21:36:49,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 331 transitions, 5686 flow [2022-12-12 21:36:49,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 321 transitions, 5506 flow [2022-12-12 21:36:49,292 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 321 transitions, 5506 flow [2022-12-12 21:36:49,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:49,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:49,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:49,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:36:49,292 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -658616190, now seen corresponding path program 1 times [2022-12-12 21:36:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:49,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332572368] [2022-12-12 21:36:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:49,456 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-12 21:36:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:49,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332572368] [2022-12-12 21:36:49,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332572368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:49,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:49,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32704987] [2022-12-12 21:36:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:49,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:49,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:49,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:49,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:49,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 64 [2022-12-12 21:36:49,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 321 transitions, 5506 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-12 21:36:49,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:49,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 64 [2022-12-12 21:36:49,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:49,818 INFO L130 PetriNetUnfolder]: 1668/3093 cut-off events. [2022-12-12 21:36:49,818 INFO L131 PetriNetUnfolder]: For 22259/22651 co-relation queries the response was YES. [2022-12-12 21:36:49,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25764 conditions, 3093 events. 1668/3093 cut-off events. For 22259/22651 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 19580 event pairs, 110 based on Foata normal form. 444/3125 useless extension candidates. Maximal degree in co-relation 25729. Up to 2339 conditions per place. [2022-12-12 21:36:49,835 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 191 selfloop transitions, 83 changer transitions 19/318 dead transitions. [2022-12-12 21:36:49,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 318 transitions, 5999 flow [2022-12-12 21:36:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-12 21:36:49,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2022-12-12 21:36:49,837 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2022-12-12 21:36:49,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 318 transitions, 5999 flow [2022-12-12 21:36:49,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 299 transitions, 5619 flow [2022-12-12 21:36:49,852 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 299 transitions, 5619 flow [2022-12-12 21:36:49,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-12 21:36:49,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:49,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:49,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:36:49,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1610133875, now seen corresponding path program 1 times [2022-12-12 21:36:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:49,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680135380] [2022-12-12 21:36:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:49,996 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-12 21:36:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:49,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680135380] [2022-12-12 21:36:49,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680135380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:49,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:49,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:36:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043821592] [2022-12-12 21:36:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:49,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:49,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:49,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 64 [2022-12-12 21:36:49,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 299 transitions, 5619 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-12 21:36:49,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:49,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 64 [2022-12-12 21:36:49,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:50,292 INFO L130 PetriNetUnfolder]: 1001/1819 cut-off events. [2022-12-12 21:36:50,292 INFO L131 PetriNetUnfolder]: For 17408/17731 co-relation queries the response was YES. [2022-12-12 21:36:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16389 conditions, 1819 events. 1001/1819 cut-off events. For 17408/17731 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9814 event pairs, 20 based on Foata normal form. 328/1900 useless extension candidates. Maximal degree in co-relation 16351. Up to 1297 conditions per place. [2022-12-12 21:36:50,303 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 111 selfloop transitions, 60 changer transitions 101/288 dead transitions. [2022-12-12 21:36:50,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 288 transitions, 5925 flow [2022-12-12 21:36:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:36:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:36:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-12 21:36:50,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.346875 [2022-12-12 21:36:50,305 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2022-12-12 21:36:50,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 288 transitions, 5925 flow [2022-12-12 21:36:50,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 187 transitions, 3819 flow [2022-12-12 21:36:50,314 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 187 transitions, 3819 flow [2022-12-12 21:36:50,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-12 21:36:50,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:50,314 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:50,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:36:50,314 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1968706138, now seen corresponding path program 1 times [2022-12-12 21:36:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:50,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154832770] [2022-12-12 21:36:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:50,448 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-12 21:36:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:50,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154832770] [2022-12-12 21:36:50,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154832770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:50,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:50,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702788890] [2022-12-12 21:36:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:50,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:50,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:36:50,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 187 transitions, 3819 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-12 21:36:50,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:50,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:36:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:50,677 INFO L130 PetriNetUnfolder]: 1027/1902 cut-off events. [2022-12-12 21:36:50,678 INFO L131 PetriNetUnfolder]: For 16993/17087 co-relation queries the response was YES. [2022-12-12 21:36:50,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19339 conditions, 1902 events. 1027/1902 cut-off events. For 16993/17087 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10525 event pairs, 9 based on Foata normal form. 59/1656 useless extension candidates. Maximal degree in co-relation 19298. Up to 1469 conditions per place. [2022-12-12 21:36:50,685 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 86 selfloop transitions, 4 changer transitions 166/272 dead transitions. [2022-12-12 21:36:50,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 272 transitions, 6187 flow [2022-12-12 21:36:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-12 21:36:50,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2022-12-12 21:36:50,687 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2022-12-12 21:36:50,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 272 transitions, 6187 flow [2022-12-12 21:36:50,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 106 transitions, 2285 flow [2022-12-12 21:36:50,693 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 106 transitions, 2285 flow [2022-12-12 21:36:50,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-12 21:36:50,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:50,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:50,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:36:50,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash 203643327, now seen corresponding path program 1 times [2022-12-12 21:36:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:50,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880806712] [2022-12-12 21:36:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:51,296 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-12 21:36:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:51,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880806712] [2022-12-12 21:36:51,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880806712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:51,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:51,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:36:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250964943] [2022-12-12 21:36:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:51,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:36:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:51,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:36:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:36:51,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:36:51,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 106 transitions, 2285 flow. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 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-12 21:36:51,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:51,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:36:51,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:51,530 INFO L130 PetriNetUnfolder]: 472/1017 cut-off events. [2022-12-12 21:36:51,530 INFO L131 PetriNetUnfolder]: For 6687/6724 co-relation queries the response was YES. [2022-12-12 21:36:51,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11221 conditions, 1017 events. 472/1017 cut-off events. For 6687/6724 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5906 event pairs, 0 based on Foata normal form. 40/857 useless extension candidates. Maximal degree in co-relation 11177. Up to 895 conditions per place. [2022-12-12 21:36:51,535 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 89 selfloop transitions, 17 changer transitions 30/151 dead transitions. [2022-12-12 21:36:51,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 151 transitions, 3625 flow [2022-12-12 21:36:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:36:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:36:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-12 21:36:51,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.325 [2022-12-12 21:36:51,537 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, 1 predicate places. [2022-12-12 21:36:51,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 151 transitions, 3625 flow [2022-12-12 21:36:51,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 121 transitions, 2845 flow [2022-12-12 21:36:51,541 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 121 transitions, 2845 flow [2022-12-12 21:36:51,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 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-12 21:36:51,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:51,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:51,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:36:51,541 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash -776557299, now seen corresponding path program 1 times [2022-12-12 21:36:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:51,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365316016] [2022-12-12 21:36:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:52,269 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-12 21:36:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:52,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365316016] [2022-12-12 21:36:52,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365316016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:52,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:52,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:36:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401362861] [2022-12-12 21:36:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:52,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:36:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:52,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:36:52,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:36:52,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 21:36:52,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 121 transitions, 2845 flow. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 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-12 21:36:52,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:52,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 21:36:52,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:52,542 INFO L130 PetriNetUnfolder]: 602/1446 cut-off events. [2022-12-12 21:36:52,542 INFO L131 PetriNetUnfolder]: For 8691/8715 co-relation queries the response was YES. [2022-12-12 21:36:52,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16369 conditions, 1446 events. 602/1446 cut-off events. For 8691/8715 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10278 event pairs, 0 based on Foata normal form. 34/1193 useless extension candidates. Maximal degree in co-relation 16322. Up to 1312 conditions per place. [2022-12-12 21:36:52,549 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 90 selfloop transitions, 10 changer transitions 72/187 dead transitions. [2022-12-12 21:36:52,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 187 transitions, 4893 flow [2022-12-12 21:36:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:36:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:36:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-12 21:36:52,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.359375 [2022-12-12 21:36:52,551 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2022-12-12 21:36:52,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 187 transitions, 4893 flow [2022-12-12 21:36:52,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 115 transitions, 2895 flow [2022-12-12 21:36:52,557 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 115 transitions, 2895 flow [2022-12-12 21:36:52,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 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-12 21:36:52,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:52,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:52,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:36:52,558 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:36:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -682230597, now seen corresponding path program 1 times [2022-12-12 21:36:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:52,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822570170] [2022-12-12 21:36:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:36:52,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:36:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:36:52,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:36:52,632 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:36:52,632 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:36:52,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:36:52,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:36:52,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:36:52,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:36:52,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:36:52,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:36:52,635 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:52,639 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:36:52,639 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:36:52,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:36:52 BasicIcfg [2022-12-12 21:36:52,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:36:52,710 INFO L158 Benchmark]: Toolchain (without parser) took 20385.51ms. Allocated memory was 179.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 154.5MB in the beginning and 741.7MB in the end (delta: -587.1MB). Peak memory consumption was 545.3MB. Max. memory is 8.0GB. [2022-12-12 21:36:52,711 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:36:52,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.96ms. Allocated memory is still 179.3MB. Free memory was 154.0MB in the beginning and 126.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 21:36:52,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.96ms. Allocated memory is still 179.3MB. Free memory was 126.8MB in the beginning and 124.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:36:52,712 INFO L158 Benchmark]: Boogie Preprocessor took 41.43ms. Allocated memory is still 179.3MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:36:52,712 INFO L158 Benchmark]: RCFGBuilder took 557.28ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 122.0MB in the beginning and 183.2MB in the end (delta: -61.1MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2022-12-12 21:36:52,713 INFO L158 Benchmark]: TraceAbstraction took 19275.18ms. Allocated memory was 216.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 181.6MB in the beginning and 741.7MB in the end (delta: -560.1MB). Peak memory consumption was 534.6MB. Max. memory is 8.0GB. [2022-12-12 21:36:52,714 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 179.3MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.96ms. Allocated memory is still 179.3MB. Free memory was 154.0MB in the beginning and 126.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.96ms. Allocated memory is still 179.3MB. Free memory was 126.8MB in the beginning and 124.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.43ms. Allocated memory is still 179.3MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 557.28ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 122.0MB in the beginning and 183.2MB in the end (delta: -61.1MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19275.18ms. Allocated memory was 216.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 181.6MB in the beginning and 741.7MB in the end (delta: -560.1MB). Peak memory consumption was 534.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 121 PlacesBefore, 74 PlacesAfterwards, 113 TransitionsBefore, 64 TransitionsAfterwards, 2290 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 44 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4365, independent: 4176, independent conditional: 4176, independent unconditional: 0, dependent: 189, dependent conditional: 189, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4365, independent: 4176, independent conditional: 0, independent unconditional: 4176, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4365, independent: 4176, independent conditional: 0, independent unconditional: 4176, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4365, independent: 4176, independent conditional: 0, independent unconditional: 4176, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2315, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2315, independent: 2200, independent conditional: 0, independent unconditional: 2200, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 460, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4365, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 2315, unknown conditional: 0, unknown unconditional: 2315] , Statistics on independence cache: Total cache size (in pairs): 4220, Positive cache size: 4137, Positive conditional cache size: 0, Positive unconditional cache size: 4137, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t891, ((void *)0), P0, ((void *)0))=-3, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t892, ((void *)0), P1, ((void *)0))=-2, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t893, ((void *)0), P2, ((void *)0))=-1, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 841]: 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1142 IncrementalHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 24 mSDtfsCounter, 1142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5619occurred in iteration=9, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 10446 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 1837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-12 21:36:52,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...