/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:36:45,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:36:45,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:36:45,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:36:45,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:36:45,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:36:45,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:36:45,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:36:45,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:36:45,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:36:45,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:36:45,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:36:45,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:36:45,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:36:45,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:36:45,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:36:45,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:36:45,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:36:45,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:36:45,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:36:45,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:36:45,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:36:45,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:36:45,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:36:45,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:36:45,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:36:45,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:36:45,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:36:45,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:36:45,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:36:45,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:36:45,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:36:45,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:36:45,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:36:45,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:36:45,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:36:45,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:36:45,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:36:45,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:36:45,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:36:45,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:36:45,714 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 18:36:45,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:36:45,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:36:45,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:36:45,747 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:36:45,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:36:45,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:36:45,749 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:36:45,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:36:45,749 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:36:45,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:36:45,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:36:45,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:36:45,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:36:45,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:36:45,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:36:45,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:36:45,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:36:45,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:36:45,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:36:45,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:36:45,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:36:45,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:36:45,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:36:45,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:36:45,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:36:45,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:36:45,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:36:45,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:36:45,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:36:45,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:36:45,753 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 [2022-12-12 18:36:46,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:36:46,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:36:46,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:36:46,098 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:36:46,098 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:36:46,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 18:36:47,270 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:36:47,538 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:36:47,539 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 18:36:47,561 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b14f2ae7/09e5f99f18134f3ba2c13fb17180c35f/FLAGc18800dbb [2022-12-12 18:36:47,573 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b14f2ae7/09e5f99f18134f3ba2c13fb17180c35f [2022-12-12 18:36:47,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:36:47,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:36:47,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:36:47,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:36:47,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:36:47,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:47,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2eb44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47, skipping insertion in model container [2022-12-12 18:36:47,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:47,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:36:47,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:36:47,748 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 18:36:47,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:36:47,898 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:36:47,908 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 18:36:47,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:47,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:47,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:36:47,998 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:36:47,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47 WrapperNode [2022-12-12 18:36:47,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:36:48,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:36:48,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:36:48,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:36:48,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,073 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-12 18:36:48,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:36:48,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:36:48,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:36:48,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:36:48,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,111 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:36:48,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:36:48,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:36:48,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:36:48,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (1/1) ... [2022-12-12 18:36:48,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:36:48,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:36:48,173 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 18:36:48,188 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 18:36:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:36:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:36:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:36:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:36:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:36:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:36:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:36:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:36:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:36:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:36:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:36:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:36:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:36:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:36:48,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:36:48,221 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 18:36:48,400 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:36:48,402 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:36:48,656 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:36:48,803 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:36:48,803 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:36:48,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:36:48 BoogieIcfgContainer [2022-12-12 18:36:48,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:36:48,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:36:48,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:36:48,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:36:48,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:36:47" (1/3) ... [2022-12-12 18:36:48,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3271fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:36:48, skipping insertion in model container [2022-12-12 18:36:48,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:47" (2/3) ... [2022-12-12 18:36:48,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3271fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:36:48, skipping insertion in model container [2022-12-12 18:36:48,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:36:48" (3/3) ... [2022-12-12 18:36:48,813 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 18:36:48,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:36:48,830 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:36:48,831 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:36:48,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:36:48,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 18:36:49,058 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 18:36:49,058 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:49,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:36:49,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 18:36:49,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:36:49,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,117 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 18:36:49,117 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:49,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:36:49,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 18:36:49,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-12 18:36:53,936 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-12 18:36:53,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:36:53,955 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;@10fe5756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:36:53,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:36:53,958 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-12 18:36:53,958 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:53,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:53,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 18:36:53,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 515099, now seen corresponding path program 1 times [2022-12-12 18:36:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:53,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236433025] [2022-12-12 18:36:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:54,284 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 18:36:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236433025] [2022-12-12 18:36:54,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236433025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:54,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:54,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:36:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038686098] [2022-12-12 18:36:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:54,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:54,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:54,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:54,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 69 [2022-12-12 18:36:54,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 147 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 18:36:54,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:54,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 69 [2022-12-12 18:36:54,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:56,072 INFO L130 PetriNetUnfolder]: 10840/17378 cut-off events. [2022-12-12 18:36:56,072 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 18:36:56,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32841 conditions, 17378 events. 10840/17378 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 136902 event pairs, 1440 based on Foata normal form. 0/10486 useless extension candidates. Maximal degree in co-relation 32830. Up to 13045 conditions per place. [2022-12-12 18:36:56,130 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 38 selfloop transitions, 2 changer transitions 59/111 dead transitions. [2022-12-12 18:36:56,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 433 flow [2022-12-12 18:36:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:36:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:36:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-12-12 18:36:56,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2022-12-12 18:36:56,146 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2022-12-12 18:36:56,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 111 transitions, 433 flow [2022-12-12 18:36:56,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 52 transitions, 199 flow [2022-12-12 18:36:56,173 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 52 transitions, 199 flow [2022-12-12 18:36:56,173 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 18:36:56,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:56,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:56,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:36:56,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash 5120902, now seen corresponding path program 1 times [2022-12-12 18:36:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:56,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701365960] [2022-12-12 18:36:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:56,411 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 18:36:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701365960] [2022-12-12 18:36:56,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701365960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:56,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:56,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:36:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885005169] [2022-12-12 18:36:56,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:56,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:56,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 69 [2022-12-12 18:36:56,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 52 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 18:36:56,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:56,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 69 [2022-12-12 18:36:56,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:57,317 INFO L130 PetriNetUnfolder]: 5349/8268 cut-off events. [2022-12-12 18:36:57,317 INFO L131 PetriNetUnfolder]: For 1108/1108 co-relation queries the response was YES. [2022-12-12 18:36:57,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22579 conditions, 8268 events. 5349/8268 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 50630 event pairs, 1047 based on Foata normal form. 198/6986 useless extension candidates. Maximal degree in co-relation 22565. Up to 5884 conditions per place. [2022-12-12 18:36:57,363 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 64 selfloop transitions, 7 changer transitions 2/81 dead transitions. [2022-12-12 18:36:57,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 459 flow [2022-12-12 18:36:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:36:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:36:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-12 18:36:57,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3719806763285024 [2022-12-12 18:36:57,366 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2022-12-12 18:36:57,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 81 transitions, 459 flow [2022-12-12 18:36:57,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 79 transitions, 451 flow [2022-12-12 18:36:57,400 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 79 transitions, 451 flow [2022-12-12 18:36:57,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 18:36:57,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:57,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:57,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:36:57,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 158748357, now seen corresponding path program 1 times [2022-12-12 18:36:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:57,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710404648] [2022-12-12 18:36:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:57,600 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 18:36:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:57,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710404648] [2022-12-12 18:36:57,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710404648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:57,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:57,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:36:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73037823] [2022-12-12 18:36:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:57,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:36:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:36:57,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:36:57,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 69 [2022-12-12 18:36:57,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 79 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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 18:36:57,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:57,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 69 [2022-12-12 18:36:57,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:58,222 INFO L130 PetriNetUnfolder]: 3848/6044 cut-off events. [2022-12-12 18:36:58,223 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-12 18:36:58,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22542 conditions, 6044 events. 3848/6044 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 35404 event pairs, 148 based on Foata normal form. 90/5053 useless extension candidates. Maximal degree in co-relation 22525. Up to 4614 conditions per place. [2022-12-12 18:36:58,255 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 86 selfloop transitions, 7 changer transitions 4/105 dead transitions. [2022-12-12 18:36:58,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 105 transitions, 795 flow [2022-12-12 18:36:58,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:36:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:36:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-12 18:36:58,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.322463768115942 [2022-12-12 18:36:58,261 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2022-12-12 18:36:58,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 105 transitions, 795 flow [2022-12-12 18:36:58,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 101 transitions, 763 flow [2022-12-12 18:36:58,289 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 101 transitions, 763 flow [2022-12-12 18:36:58,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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 18:36:58,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:58,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:58,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:36:58,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 630124774, now seen corresponding path program 1 times [2022-12-12 18:36:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:58,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386792644] [2022-12-12 18:36:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:58,467 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 18:36:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386792644] [2022-12-12 18:36:58,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386792644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:58,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:58,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:36:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516944153] [2022-12-12 18:36:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:58,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:36:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:58,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:36:58,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:36:58,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 69 [2022-12-12 18:36:58,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 101 transitions, 763 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 18:36:58,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:58,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 69 [2022-12-12 18:36:58,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:58,979 INFO L130 PetriNetUnfolder]: 3404/5361 cut-off events. [2022-12-12 18:36:58,980 INFO L131 PetriNetUnfolder]: For 631/631 co-relation queries the response was YES. [2022-12-12 18:36:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25022 conditions, 5361 events. 3404/5361 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 30609 event pairs, 138 based on Foata normal form. 10/4532 useless extension candidates. Maximal degree in co-relation 25002. Up to 4081 conditions per place. [2022-12-12 18:36:59,016 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 102 selfloop transitions, 15 changer transitions 0/125 dead transitions. [2022-12-12 18:36:59,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 125 transitions, 1191 flow [2022-12-12 18:36:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:36:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:36:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-12 18:36:59,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3442028985507246 [2022-12-12 18:36:59,020 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2022-12-12 18:36:59,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 125 transitions, 1191 flow [2022-12-12 18:36:59,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 125 transitions, 1191 flow [2022-12-12 18:36:59,048 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 125 transitions, 1191 flow [2022-12-12 18:36:59,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 18:36:59,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:59,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:59,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:36:59,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:59,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1940869511, now seen corresponding path program 1 times [2022-12-12 18:36:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:59,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556502465] [2022-12-12 18:36:59,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:59,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:59,176 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 18:36:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:59,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556502465] [2022-12-12 18:36:59,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556502465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:59,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:59,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:36:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970807604] [2022-12-12 18:36:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:59,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:59,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:59,178 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 69 [2022-12-12 18:36:59,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 125 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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 18:36:59,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:59,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 69 [2022-12-12 18:36:59,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:59,707 INFO L130 PetriNetUnfolder]: 4214/6516 cut-off events. [2022-12-12 18:36:59,707 INFO L131 PetriNetUnfolder]: For 7687/7783 co-relation queries the response was YES. [2022-12-12 18:36:59,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34782 conditions, 6516 events. 4214/6516 cut-off events. For 7687/7783 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 37338 event pairs, 567 based on Foata normal form. 148/5770 useless extension candidates. Maximal degree in co-relation 34759. Up to 5650 conditions per place. [2022-12-12 18:36:59,749 INFO L137 encePairwiseOnDemand]: 58/69 looper letters, 132 selfloop transitions, 34 changer transitions 0/182 dead transitions. [2022-12-12 18:36:59,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 182 transitions, 2081 flow [2022-12-12 18:36:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:36:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:36:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-12 18:36:59,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3671497584541063 [2022-12-12 18:36:59,751 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-12 18:36:59,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 182 transitions, 2081 flow [2022-12-12 18:36:59,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 182 transitions, 2081 flow [2022-12-12 18:36:59,783 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 182 transitions, 2081 flow [2022-12-12 18:36:59,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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 18:36:59,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:59,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:36:59,784 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 610324497, now seen corresponding path program 1 times [2022-12-12 18:36:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:59,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003671457] [2022-12-12 18:36:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:59,902 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 18:36:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:59,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003671457] [2022-12-12 18:36:59,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003671457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:59,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:59,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:36:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580374205] [2022-12-12 18:36:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:59,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:59,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:59,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 69 [2022-12-12 18:36:59,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 182 transitions, 2081 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 18:36:59,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:59,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 69 [2022-12-12 18:36:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:00,749 INFO L130 PetriNetUnfolder]: 5553/8621 cut-off events. [2022-12-12 18:37:00,750 INFO L131 PetriNetUnfolder]: For 16445/16632 co-relation queries the response was YES. [2022-12-12 18:37:00,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52740 conditions, 8621 events. 5553/8621 cut-off events. For 16445/16632 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 52282 event pairs, 750 based on Foata normal form. 267/7627 useless extension candidates. Maximal degree in co-relation 52714. Up to 7571 conditions per place. [2022-12-12 18:37:00,804 INFO L137 encePairwiseOnDemand]: 66/69 looper letters, 162 selfloop transitions, 9 changer transitions 36/224 dead transitions. [2022-12-12 18:37:00,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 224 transitions, 3003 flow [2022-12-12 18:37:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:37:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:37:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-12 18:37:00,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36231884057971014 [2022-12-12 18:37:00,807 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2022-12-12 18:37:00,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 224 transitions, 3003 flow [2022-12-12 18:37:00,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 188 transitions, 2503 flow [2022-12-12 18:37:00,841 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 188 transitions, 2503 flow [2022-12-12 18:37:00,842 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 18:37:00,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:00,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:00,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:37:00,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1997211001, now seen corresponding path program 1 times [2022-12-12 18:37:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:00,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506936125] [2022-12-12 18:37:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:00,960 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 18:37:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506936125] [2022-12-12 18:37:00,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506936125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:00,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:00,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:37:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351327758] [2022-12-12 18:37:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:00,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:37:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:37:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:37:00,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 69 [2022-12-12 18:37:00,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 188 transitions, 2503 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 18:37:00,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:00,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 69 [2022-12-12 18:37:00,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:02,039 INFO L130 PetriNetUnfolder]: 7568/11920 cut-off events. [2022-12-12 18:37:02,044 INFO L131 PetriNetUnfolder]: For 25833/26016 co-relation queries the response was YES. [2022-12-12 18:37:02,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82377 conditions, 11920 events. 7568/11920 cut-off events. For 25833/26016 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 79817 event pairs, 1545 based on Foata normal form. 243/10250 useless extension candidates. Maximal degree in co-relation 82348. Up to 10896 conditions per place. [2022-12-12 18:37:02,083 INFO L137 encePairwiseOnDemand]: 66/69 looper letters, 215 selfloop transitions, 10 changer transitions 78/320 dead transitions. [2022-12-12 18:37:02,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 320 transitions, 4951 flow [2022-12-12 18:37:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:37:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:37:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-12 18:37:02,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 18:37:02,085 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2022-12-12 18:37:02,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 320 transitions, 4951 flow [2022-12-12 18:37:02,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 242 transitions, 3709 flow [2022-12-12 18:37:02,212 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 242 transitions, 3709 flow [2022-12-12 18:37:02,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 18:37:02,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:02,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:02,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:37:02,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1272036889, now seen corresponding path program 2 times [2022-12-12 18:37:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:02,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143758706] [2022-12-12 18:37:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:02,338 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 18:37:02,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:02,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143758706] [2022-12-12 18:37:02,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143758706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:02,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:02,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:37:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481774024] [2022-12-12 18:37:02,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:02,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:37:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:02,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:37:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:37:02,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 69 [2022-12-12 18:37:02,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 242 transitions, 3709 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 18:37:02,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:02,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 69 [2022-12-12 18:37:02,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:02,894 INFO L130 PetriNetUnfolder]: 2293/4584 cut-off events. [2022-12-12 18:37:02,894 INFO L131 PetriNetUnfolder]: For 14568/14893 co-relation queries the response was YES. [2022-12-12 18:37:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35692 conditions, 4584 events. 2293/4584 cut-off events. For 14568/14893 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 35407 event pairs, 204 based on Foata normal form. 426/4293 useless extension candidates. Maximal degree in co-relation 35660. Up to 4023 conditions per place. [2022-12-12 18:37:02,913 INFO L137 encePairwiseOnDemand]: 58/69 looper letters, 137 selfloop transitions, 71 changer transitions 67/288 dead transitions. [2022-12-12 18:37:02,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 288 transitions, 4960 flow [2022-12-12 18:37:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:37:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:37:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-12 18:37:02,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2022-12-12 18:37:02,915 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -15 predicate places. [2022-12-12 18:37:02,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 288 transitions, 4960 flow [2022-12-12 18:37:02,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 221 transitions, 3762 flow [2022-12-12 18:37:02,930 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 221 transitions, 3762 flow [2022-12-12 18:37:02,930 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 18:37:02,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:02,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:02,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:37:02,931 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash 424852268, now seen corresponding path program 1 times [2022-12-12 18:37:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:02,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422420867] [2022-12-12 18:37:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:03,193 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 18:37:03,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:03,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422420867] [2022-12-12 18:37:03,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422420867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:03,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:03,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:37:03,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211844703] [2022-12-12 18:37:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:03,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:37:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:37:03,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:37:03,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 69 [2022-12-12 18:37:03,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 221 transitions, 3762 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 18:37:03,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:03,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 69 [2022-12-12 18:37:03,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:03,590 INFO L130 PetriNetUnfolder]: 951/2075 cut-off events. [2022-12-12 18:37:03,590 INFO L131 PetriNetUnfolder]: For 10181/10398 co-relation queries the response was YES. [2022-12-12 18:37:03,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17801 conditions, 2075 events. 951/2075 cut-off events. For 10181/10398 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14311 event pairs, 3 based on Foata normal form. 338/2096 useless extension candidates. Maximal degree in co-relation 17766. Up to 1664 conditions per place. [2022-12-12 18:37:03,599 INFO L137 encePairwiseOnDemand]: 58/69 looper letters, 53 selfloop transitions, 46 changer transitions 108/214 dead transitions. [2022-12-12 18:37:03,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 214 transitions, 4038 flow [2022-12-12 18:37:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:37:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:37:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-12-12 18:37:03,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33043478260869563 [2022-12-12 18:37:03,601 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-12 18:37:03,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 214 transitions, 4038 flow [2022-12-12 18:37:03,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 106 transitions, 1944 flow [2022-12-12 18:37:03,606 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 106 transitions, 1944 flow [2022-12-12 18:37:03,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 18:37:03,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:03,607 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] [2022-12-12 18:37:03,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:37:03,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 603679571, now seen corresponding path program 1 times [2022-12-12 18:37:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451391356] [2022-12-12 18:37:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:04,215 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 18:37:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:04,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451391356] [2022-12-12 18:37:04,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451391356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:04,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:04,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:37:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449547437] [2022-12-12 18:37:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:04,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:37:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:04,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:37:04,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:37:04,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 69 [2022-12-12 18:37:04,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 106 transitions, 1944 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 18:37:04,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:04,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 69 [2022-12-12 18:37:04,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:37:04,504 INFO L130 PetriNetUnfolder]: 601/1194 cut-off events. [2022-12-12 18:37:04,504 INFO L131 PetriNetUnfolder]: For 5454/5467 co-relation queries the response was YES. [2022-12-12 18:37:04,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11475 conditions, 1194 events. 601/1194 cut-off events. For 5454/5467 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6390 event pairs, 0 based on Foata normal form. 34/1008 useless extension candidates. Maximal degree in co-relation 11437. Up to 1045 conditions per place. [2022-12-12 18:37:04,510 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 66 selfloop transitions, 6 changer transitions 77/163 dead transitions. [2022-12-12 18:37:04,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 163 transitions, 3390 flow [2022-12-12 18:37:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:37:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:37:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2022-12-12 18:37:04,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2774327122153209 [2022-12-12 18:37:04,512 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -8 predicate places. [2022-12-12 18:37:04,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 163 transitions, 3390 flow [2022-12-12 18:37:04,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 86 transitions, 1715 flow [2022-12-12 18:37:04,517 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 86 transitions, 1715 flow [2022-12-12 18:37:04,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 18:37:04,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:04,518 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] [2022-12-12 18:37:04,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:37:04,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:37:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash -207598973, now seen corresponding path program 2 times [2022-12-12 18:37:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:04,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604028109] [2022-12-12 18:37:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:37:04,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:37:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:37:04,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:37:04,652 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:37:04,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:37:04,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:37:04,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:37:04,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:37:04,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:37:04,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:37:04,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:37:04,659 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:04,665 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:37:04,665 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:37:04,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:37:04 BasicIcfg [2022-12-12 18:37:04,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:37:04,742 INFO L158 Benchmark]: Toolchain (without parser) took 17166.09ms. Allocated memory was 182.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 157.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 609.4MB. Max. memory is 8.0GB. [2022-12-12 18:37:04,742 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:37:04,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.22ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 131.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 18:37:04,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.37ms. Allocated memory is still 182.5MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:37:04,744 INFO L158 Benchmark]: Boogie Preprocessor took 41.44ms. Allocated memory is still 182.5MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:37:04,744 INFO L158 Benchmark]: RCFGBuilder took 688.93ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 91.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 18:37:04,745 INFO L158 Benchmark]: TraceAbstraction took 15933.56ms. Allocated memory was 182.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 90.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 541.3MB. Max. memory is 8.0GB. [2022-12-12 18:37:04,746 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.11ms. Allocated memory is still 182.5MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.22ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 131.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.37ms. Allocated memory is still 182.5MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.44ms. Allocated memory is still 182.5MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 688.93ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 91.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15933.56ms. Allocated memory was 182.5MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 90.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 541.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 117 PlacesBefore, 78 PlacesAfterwards, 109 TransitionsBefore, 69 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 4320, independent unconditional: 0, dependent: 133, dependent conditional: 133, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2217, independent: 2175, independent conditional: 0, independent unconditional: 2175, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2217, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 228, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4453, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 2217, unknown conditional: 0, unknown unconditional: 2217] , Statistics on independence cache: Total cache size (in pairs): 4387, Positive cache size: 4345, Positive conditional cache size: 0, Positive unconditional cache size: 4345, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-3, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-2, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 816 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 13 mSDtfsCounter, 816 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3762occurred in iteration=8, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 6983 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:37:04,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...