/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:36:34,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:36:34,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:36:34,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:36:34,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:36:34,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:36:34,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:36:34,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:36:34,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:36:34,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:36:34,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:36:34,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:36:34,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:36:34,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:36:34,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:36:34,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:36:34,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:36:34,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:36:34,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:36:34,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:36:34,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:36:34,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:36:34,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:36:34,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:36:34,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:36:34,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:36:34,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:36:34,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:36:34,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:36:34,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:36:34,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:36:34,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:36:34,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:36:34,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:36:34,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:36:34,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:36:34,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:36:34,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:36:34,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:36:34,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:36:34,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:36:34,966 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-NoLbe.epf [2022-12-05 18:36:34,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:36:34,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:36:35,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:36:35,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:36:35,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:36:35,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:36:35,002 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:36:35,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:36:35,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:36:35,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:36:35,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:36:35,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:36:35,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:36:35,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:36:35,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:36:35,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:36:35,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:36:35,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:36:35,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:36:35,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:36:35,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:36:35,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:36:35,005 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:36:35,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:36:35,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 18:36:35,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:36:35,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:36:35,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:36:35,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:36:35,265 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:36:35,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:36:36,299 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:36:36,583 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:36:36,591 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:36:36,604 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052e0d1f3/d6c119c058914b609db309c3b227fc33/FLAG583272b03 [2022-12-05 18:36:36,642 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052e0d1f3/d6c119c058914b609db309c3b227fc33 [2022-12-05 18:36:36,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:36:36,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:36:36,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:36:36,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:36:36,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:36:36,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:36:36" (1/1) ... [2022-12-05 18:36:36,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc09385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:36, skipping insertion in model container [2022-12-05 18:36:36,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:36:36" (1/1) ... [2022-12-05 18:36:36,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:36:36,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:36:36,855 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:36:36,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:36,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:36,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:36:37,045 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:36:37,053 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:36:37,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:36:37,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:36:37,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:36:37,144 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:36:37,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37 WrapperNode [2022-12-05 18:36:37,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:36:37,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:36:37,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:36:37,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:36:37,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,188 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-05 18:36:37,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:36:37,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:36:37,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:36:37,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:36:37,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:36:37,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:36:37,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:36:37,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:36:37,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (1/1) ... [2022-12-05 18:36:37,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:36:37,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:36:37,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 18:36:37,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 18:36:37,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:36:37,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:36:37,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:36:37,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:36:37,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:36:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:36:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:36:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:36:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:36:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:36:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:36:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:36:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:36:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:36:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:36:37,319 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 18:36:37,409 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:36:37,411 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:36:37,663 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:36:37,759 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:36:37,759 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:36:37,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:36:37 BoogieIcfgContainer [2022-12-05 18:36:37,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:36:37,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:36:37,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:36:37,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:36:37,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:36:36" (1/3) ... [2022-12-05 18:36:37,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5d835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:36:37, skipping insertion in model container [2022-12-05 18:36:37,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:36:37" (2/3) ... [2022-12-05 18:36:37,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5d835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:36:37, skipping insertion in model container [2022-12-05 18:36:37,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:36:37" (3/3) ... [2022-12-05 18:36:37,769 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:36:37,782 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:36:37,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:36:37,783 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:36:37,866 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:36:37,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 18:36:37,938 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-05 18:36:37,939 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:36:37,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 18:36:37,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-05 18:36:37,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-05 18:36:37,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:36:37,968 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;@506955bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:36:37,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 18:36:37,997 INFO L130 PetriNetUnfolder]: 0/70 cut-off events. [2022-12-05 18:36:37,997 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:36:37,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:37,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:37,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1367498785, now seen corresponding path program 1 times [2022-12-05 18:36:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:38,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073120446] [2022-12-05 18:36:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:38,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073120446] [2022-12-05 18:36:38,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073120446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:38,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:38,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:36:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466875581] [2022-12-05 18:36:38,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:38,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:36:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:36:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:36:38,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110 [2022-12-05 18:36:38,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:38,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:38,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110 [2022-12-05 18:36:38,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:38,563 INFO L130 PetriNetUnfolder]: 17/184 cut-off events. [2022-12-05 18:36:38,563 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 18:36:38,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 184 events. 17/184 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 480 event pairs, 3 based on Foata normal form. 9/186 useless extension candidates. Maximal degree in co-relation 186. Up to 27 conditions per place. [2022-12-05 18:36:38,568 INFO L137 encePairwiseOnDemand]: 105/110 looper letters, 10 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-12-05 18:36:38,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 245 flow [2022-12-05 18:36:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:36:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:36:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-12-05 18:36:38,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-12-05 18:36:38,583 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 223 flow. Second operand 3 states and 308 transitions. [2022-12-05 18:36:38,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 106 transitions, 245 flow [2022-12-05 18:36:38,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 18:36:38,589 INFO L231 Difference]: Finished difference. Result has 112 places, 103 transitions, 216 flow [2022-12-05 18:36:38,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=112, PETRI_TRANSITIONS=103} [2022-12-05 18:36:38,594 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2022-12-05 18:36:38,594 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 103 transitions, 216 flow [2022-12-05 18:36:38,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:38,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:38,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:38,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:36:38,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 405999513, now seen corresponding path program 1 times [2022-12-05 18:36:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:38,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101098711] [2022-12-05 18:36:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:39,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:39,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101098711] [2022-12-05 18:36:39,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101098711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:39,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:39,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:36:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973826960] [2022-12-05 18:36:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:39,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:36:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:36:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:36:39,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2022-12-05 18:36:39,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 103 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:39,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:39,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2022-12-05 18:36:39,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:40,875 INFO L130 PetriNetUnfolder]: 995/2649 cut-off events. [2022-12-05 18:36:40,875 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-05 18:36:40,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4327 conditions, 2649 events. 995/2649 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 21099 event pairs, 164 based on Foata normal form. 0/2580 useless extension candidates. Maximal degree in co-relation 4268. Up to 581 conditions per place. [2022-12-05 18:36:40,908 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 35 selfloop transitions, 8 changer transitions 76/184 dead transitions. [2022-12-05 18:36:40,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 184 transitions, 604 flow [2022-12-05 18:36:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:36:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:36:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2022-12-05 18:36:40,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.779020979020979 [2022-12-05 18:36:40,917 INFO L175 Difference]: Start difference. First operand has 112 places, 103 transitions, 216 flow. Second operand 13 states and 1114 transitions. [2022-12-05 18:36:40,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 184 transitions, 604 flow [2022-12-05 18:36:40,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 184 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:36:40,922 INFO L231 Difference]: Finished difference. Result has 134 places, 99 transitions, 300 flow [2022-12-05 18:36:40,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=300, PETRI_PLACES=134, PETRI_TRANSITIONS=99} [2022-12-05 18:36:40,922 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 19 predicate places. [2022-12-05 18:36:40,923 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 99 transitions, 300 flow [2022-12-05 18:36:40,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:40,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:40,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:40,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:36:40,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -87558250, now seen corresponding path program 1 times [2022-12-05 18:36:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:40,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110200680] [2022-12-05 18:36:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110200680] [2022-12-05 18:36:41,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110200680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:41,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:41,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:36:41,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310200959] [2022-12-05 18:36:41,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:41,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:36:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:41,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:36:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:36:41,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2022-12-05 18:36:41,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 99 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:41,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:41,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2022-12-05 18:36:41,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:42,337 INFO L130 PetriNetUnfolder]: 631/1661 cut-off events. [2022-12-05 18:36:42,338 INFO L131 PetriNetUnfolder]: For 3278/3840 co-relation queries the response was YES. [2022-12-05 18:36:42,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5204 conditions, 1661 events. 631/1661 cut-off events. For 3278/3840 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11680 event pairs, 116 based on Foata normal form. 37/1661 useless extension candidates. Maximal degree in co-relation 5133. Up to 531 conditions per place. [2022-12-05 18:36:42,379 INFO L137 encePairwiseOnDemand]: 95/110 looper letters, 37 selfloop transitions, 18 changer transitions 55/175 dead transitions. [2022-12-05 18:36:42,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 175 transitions, 1040 flow [2022-12-05 18:36:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:36:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:36:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1109 transitions. [2022-12-05 18:36:42,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7755244755244756 [2022-12-05 18:36:42,382 INFO L175 Difference]: Start difference. First operand has 134 places, 99 transitions, 300 flow. Second operand 13 states and 1109 transitions. [2022-12-05 18:36:42,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 175 transitions, 1040 flow [2022-12-05 18:36:42,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 175 transitions, 988 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-05 18:36:42,416 INFO L231 Difference]: Finished difference. Result has 134 places, 107 transitions, 429 flow [2022-12-05 18:36:42,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=429, PETRI_PLACES=134, PETRI_TRANSITIONS=107} [2022-12-05 18:36:42,417 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 19 predicate places. [2022-12-05 18:36:42,418 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 107 transitions, 429 flow [2022-12-05 18:36:42,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:42,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:42,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:42,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:36:42,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash 559570591, now seen corresponding path program 1 times [2022-12-05 18:36:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:42,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436776168] [2022-12-05 18:36:42,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:43,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436776168] [2022-12-05 18:36:43,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436776168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:43,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:43,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 18:36:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3146467] [2022-12-05 18:36:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:43,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 18:36:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 18:36:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-05 18:36:43,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-05 18:36:43,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 107 transitions, 429 flow. Second operand has 9 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:43,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:43,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-05 18:36:43,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:43,528 INFO L130 PetriNetUnfolder]: 377/1154 cut-off events. [2022-12-05 18:36:43,528 INFO L131 PetriNetUnfolder]: For 3312/3939 co-relation queries the response was YES. [2022-12-05 18:36:43,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3975 conditions, 1154 events. 377/1154 cut-off events. For 3312/3939 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8008 event pairs, 136 based on Foata normal form. 39/1130 useless extension candidates. Maximal degree in co-relation 3898. Up to 393 conditions per place. [2022-12-05 18:36:43,535 INFO L137 encePairwiseOnDemand]: 99/110 looper letters, 26 selfloop transitions, 10 changer transitions 31/150 dead transitions. [2022-12-05 18:36:43,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 150 transitions, 875 flow [2022-12-05 18:36:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:36:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:36:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1093 transitions. [2022-12-05 18:36:43,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.828030303030303 [2022-12-05 18:36:43,539 INFO L175 Difference]: Start difference. First operand has 134 places, 107 transitions, 429 flow. Second operand 12 states and 1093 transitions. [2022-12-05 18:36:43,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 150 transitions, 875 flow [2022-12-05 18:36:43,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 150 transitions, 821 flow, removed 27 selfloop flow, removed 12 redundant places. [2022-12-05 18:36:43,549 INFO L231 Difference]: Finished difference. Result has 132 places, 113 transitions, 498 flow [2022-12-05 18:36:43,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=498, PETRI_PLACES=132, PETRI_TRANSITIONS=113} [2022-12-05 18:36:43,550 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 17 predicate places. [2022-12-05 18:36:43,550 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 113 transitions, 498 flow [2022-12-05 18:36:43,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:43,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:43,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:43,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:36:43,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:43,552 INFO L85 PathProgramCache]: Analyzing trace with hash 173560603, now seen corresponding path program 1 times [2022-12-05 18:36:43,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:43,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837744729] [2022-12-05 18:36:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:44,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837744729] [2022-12-05 18:36:44,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837744729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:44,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:44,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:36:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141784341] [2022-12-05 18:36:44,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:44,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:36:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:36:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:36:44,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-05 18:36:44,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 113 transitions, 498 flow. Second operand has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:44,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:44,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-05 18:36:44,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:44,415 INFO L130 PetriNetUnfolder]: 397/1177 cut-off events. [2022-12-05 18:36:44,415 INFO L131 PetriNetUnfolder]: For 4471/5432 co-relation queries the response was YES. [2022-12-05 18:36:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4561 conditions, 1177 events. 397/1177 cut-off events. For 4471/5432 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8104 event pairs, 59 based on Foata normal form. 27/1127 useless extension candidates. Maximal degree in co-relation 4482. Up to 447 conditions per place. [2022-12-05 18:36:44,424 INFO L137 encePairwiseOnDemand]: 99/110 looper letters, 32 selfloop transitions, 13 changer transitions 31/159 dead transitions. [2022-12-05 18:36:44,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 159 transitions, 1178 flow [2022-12-05 18:36:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:36:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:36:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1179 transitions. [2022-12-05 18:36:44,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8244755244755245 [2022-12-05 18:36:44,427 INFO L175 Difference]: Start difference. First operand has 132 places, 113 transitions, 498 flow. Second operand 13 states and 1179 transitions. [2022-12-05 18:36:44,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 159 transitions, 1178 flow [2022-12-05 18:36:44,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 159 transitions, 1160 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-05 18:36:44,435 INFO L231 Difference]: Finished difference. Result has 140 places, 118 transitions, 638 flow [2022-12-05 18:36:44,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=638, PETRI_PLACES=140, PETRI_TRANSITIONS=118} [2022-12-05 18:36:44,437 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 25 predicate places. [2022-12-05 18:36:44,437 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 118 transitions, 638 flow [2022-12-05 18:36:44,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:44,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:44,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:44,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:36:44,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash 160127621, now seen corresponding path program 2 times [2022-12-05 18:36:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:44,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767581803] [2022-12-05 18:36:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:44,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767581803] [2022-12-05 18:36:44,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767581803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:44,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:44,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:36:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841853061] [2022-12-05 18:36:44,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:44,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:36:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:36:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:36:44,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-05 18:36:44,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 118 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 87.7) internal successors, (877), 10 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:44,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:44,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-05 18:36:44,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:45,105 INFO L130 PetriNetUnfolder]: 414/1131 cut-off events. [2022-12-05 18:36:45,105 INFO L131 PetriNetUnfolder]: For 10283/11299 co-relation queries the response was YES. [2022-12-05 18:36:45,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 1131 events. 414/1131 cut-off events. For 10283/11299 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7359 event pairs, 75 based on Foata normal form. 56/1119 useless extension candidates. Maximal degree in co-relation 5621. Up to 471 conditions per place. [2022-12-05 18:36:45,116 INFO L137 encePairwiseOnDemand]: 97/110 looper letters, 34 selfloop transitions, 30 changer transitions 16/162 dead transitions. [2022-12-05 18:36:45,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 162 transitions, 1456 flow [2022-12-05 18:36:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:36:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:36:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1076 transitions. [2022-12-05 18:36:45,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8151515151515152 [2022-12-05 18:36:45,118 INFO L175 Difference]: Start difference. First operand has 140 places, 118 transitions, 638 flow. Second operand 12 states and 1076 transitions. [2022-12-05 18:36:45,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 162 transitions, 1456 flow [2022-12-05 18:36:45,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 162 transitions, 1375 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-12-05 18:36:45,133 INFO L231 Difference]: Finished difference. Result has 142 places, 137 transitions, 969 flow [2022-12-05 18:36:45,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=969, PETRI_PLACES=142, PETRI_TRANSITIONS=137} [2022-12-05 18:36:45,134 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 27 predicate places. [2022-12-05 18:36:45,134 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 137 transitions, 969 flow [2022-12-05 18:36:45,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.7) internal successors, (877), 10 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:45,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:45,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:45,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:36:45,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -67961135, now seen corresponding path program 3 times [2022-12-05 18:36:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:45,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136974661] [2022-12-05 18:36:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:45,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136974661] [2022-12-05 18:36:45,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136974661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:45,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:45,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:36:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447640880] [2022-12-05 18:36:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:45,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:36:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:36:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:36:45,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-05 18:36:45,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 137 transitions, 969 flow. Second operand has 10 states, 10 states have (on average 87.7) internal successors, (877), 10 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:45,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:45,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-05 18:36:45,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:45,925 INFO L130 PetriNetUnfolder]: 371/1108 cut-off events. [2022-12-05 18:36:45,925 INFO L131 PetriNetUnfolder]: For 11040/13130 co-relation queries the response was YES. [2022-12-05 18:36:45,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5678 conditions, 1108 events. 371/1108 cut-off events. For 11040/13130 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7643 event pairs, 51 based on Foata normal form. 107/1164 useless extension candidates. Maximal degree in co-relation 5590. Up to 425 conditions per place. [2022-12-05 18:36:45,936 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 50 selfloop transitions, 20 changer transitions 31/183 dead transitions. [2022-12-05 18:36:45,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 183 transitions, 2042 flow [2022-12-05 18:36:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:36:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:36:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1082 transitions. [2022-12-05 18:36:45,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8196969696969697 [2022-12-05 18:36:45,938 INFO L175 Difference]: Start difference. First operand has 142 places, 137 transitions, 969 flow. Second operand 12 states and 1082 transitions. [2022-12-05 18:36:45,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 183 transitions, 2042 flow [2022-12-05 18:36:45,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 183 transitions, 1853 flow, removed 91 selfloop flow, removed 10 redundant places. [2022-12-05 18:36:45,960 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 1097 flow [2022-12-05 18:36:45,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1097, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2022-12-05 18:36:45,960 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 32 predicate places. [2022-12-05 18:36:45,960 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 1097 flow [2022-12-05 18:36:45,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.7) internal successors, (877), 10 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:45,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:45,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:45,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:36:45,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash 991078254, now seen corresponding path program 1 times [2022-12-05 18:36:45,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:45,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715875401] [2022-12-05 18:36:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:46,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715875401] [2022-12-05 18:36:46,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715875401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:46,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:46,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:36:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640014727] [2022-12-05 18:36:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:46,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:36:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:36:46,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:36:46,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2022-12-05 18:36:46,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 1097 flow. Second operand has 10 states, 10 states have (on average 86.9) internal successors, (869), 10 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:46,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:46,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2022-12-05 18:36:46,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:47,082 INFO L130 PetriNetUnfolder]: 338/1084 cut-off events. [2022-12-05 18:36:47,083 INFO L131 PetriNetUnfolder]: For 10934/12775 co-relation queries the response was YES. [2022-12-05 18:36:47,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 1084 events. 338/1084 cut-off events. For 10934/12775 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7580 event pairs, 73 based on Foata normal form. 156/1179 useless extension candidates. Maximal degree in co-relation 5244. Up to 381 conditions per place. [2022-12-05 18:36:47,093 INFO L137 encePairwiseOnDemand]: 99/110 looper letters, 54 selfloop transitions, 25 changer transitions 13/173 dead transitions. [2022-12-05 18:36:47,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 173 transitions, 1749 flow [2022-12-05 18:36:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:36:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:36:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1064 transitions. [2022-12-05 18:36:47,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.806060606060606 [2022-12-05 18:36:47,096 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 1097 flow. Second operand 12 states and 1064 transitions. [2022-12-05 18:36:47,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 173 transitions, 1749 flow [2022-12-05 18:36:47,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 173 transitions, 1599 flow, removed 70 selfloop flow, removed 9 redundant places. [2022-12-05 18:36:47,109 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 1243 flow [2022-12-05 18:36:47,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1243, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2022-12-05 18:36:47,109 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 36 predicate places. [2022-12-05 18:36:47,110 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 1243 flow [2022-12-05 18:36:47,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.9) internal successors, (869), 10 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:47,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:47,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:47,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:36:47,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash 531082310, now seen corresponding path program 2 times [2022-12-05 18:36:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:47,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424835103] [2022-12-05 18:36:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:47,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424835103] [2022-12-05 18:36:47,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424835103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:47,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:47,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:36:47,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318206016] [2022-12-05 18:36:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:47,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:36:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:36:47,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:36:47,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2022-12-05 18:36:47,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 1243 flow. Second operand has 13 states, 13 states have (on average 86.46153846153847) internal successors, (1124), 13 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:47,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:47,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2022-12-05 18:36:47,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:48,029 INFO L130 PetriNetUnfolder]: 340/1095 cut-off events. [2022-12-05 18:36:48,030 INFO L131 PetriNetUnfolder]: For 10894/13943 co-relation queries the response was YES. [2022-12-05 18:36:48,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5554 conditions, 1095 events. 340/1095 cut-off events. For 10894/13943 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7707 event pairs, 81 based on Foata normal form. 92/1142 useless extension candidates. Maximal degree in co-relation 5463. Up to 389 conditions per place. [2022-12-05 18:36:48,042 INFO L137 encePairwiseOnDemand]: 99/110 looper letters, 58 selfloop transitions, 21 changer transitions 13/173 dead transitions. [2022-12-05 18:36:48,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 173 transitions, 1845 flow [2022-12-05 18:36:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:36:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:36:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1231 transitions. [2022-12-05 18:36:48,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7993506493506494 [2022-12-05 18:36:48,047 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 1243 flow. Second operand 14 states and 1231 transitions. [2022-12-05 18:36:48,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 173 transitions, 1845 flow [2022-12-05 18:36:48,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 173 transitions, 1712 flow, removed 54 selfloop flow, removed 9 redundant places. [2022-12-05 18:36:48,062 INFO L231 Difference]: Finished difference. Result has 156 places, 151 transitions, 1311 flow [2022-12-05 18:36:48,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1311, PETRI_PLACES=156, PETRI_TRANSITIONS=151} [2022-12-05 18:36:48,063 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 41 predicate places. [2022-12-05 18:36:48,063 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 1311 flow [2022-12-05 18:36:48,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.46153846153847) internal successors, (1124), 13 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:48,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:48,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:48,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:36:48,064 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1607848454, now seen corresponding path program 3 times [2022-12-05 18:36:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:48,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275612786] [2022-12-05 18:36:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:48,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275612786] [2022-12-05 18:36:48,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275612786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:48,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:48,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:36:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955299081] [2022-12-05 18:36:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:48,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:36:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:48,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:36:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:36:48,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 110 [2022-12-05 18:36:48,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 1311 flow. Second operand has 12 states, 12 states have (on average 77.25) internal successors, (927), 12 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:48,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:48,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 110 [2022-12-05 18:36:48,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:49,584 INFO L130 PetriNetUnfolder]: 489/1709 cut-off events. [2022-12-05 18:36:49,584 INFO L131 PetriNetUnfolder]: For 13316/18079 co-relation queries the response was YES. [2022-12-05 18:36:49,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8209 conditions, 1709 events. 489/1709 cut-off events. For 13316/18079 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13941 event pairs, 22 based on Foata normal form. 102/1764 useless extension candidates. Maximal degree in co-relation 8109. Up to 495 conditions per place. [2022-12-05 18:36:49,599 INFO L137 encePairwiseOnDemand]: 91/110 looper letters, 78 selfloop transitions, 59 changer transitions 48/248 dead transitions. [2022-12-05 18:36:49,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 248 transitions, 3125 flow [2022-12-05 18:36:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 18:36:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 18:36:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1533 transitions. [2022-12-05 18:36:49,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7334928229665072 [2022-12-05 18:36:49,601 INFO L175 Difference]: Start difference. First operand has 156 places, 151 transitions, 1311 flow. Second operand 19 states and 1533 transitions. [2022-12-05 18:36:49,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 248 transitions, 3125 flow [2022-12-05 18:36:49,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 248 transitions, 2883 flow, removed 104 selfloop flow, removed 12 redundant places. [2022-12-05 18:36:49,621 INFO L231 Difference]: Finished difference. Result has 169 places, 176 transitions, 1871 flow [2022-12-05 18:36:49,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1871, PETRI_PLACES=169, PETRI_TRANSITIONS=176} [2022-12-05 18:36:49,621 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 54 predicate places. [2022-12-05 18:36:49,622 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 176 transitions, 1871 flow [2022-12-05 18:36:49,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.25) internal successors, (927), 12 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:49,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:49,622 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:49,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:36:49,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1236990082, now seen corresponding path program 1 times [2022-12-05 18:36:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:49,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939188289] [2022-12-05 18:36:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:49,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939188289] [2022-12-05 18:36:49,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939188289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:49,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:49,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:36:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321691152] [2022-12-05 18:36:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:49,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:36:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:49,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:36:49,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:36:49,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-05 18:36:49,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 176 transitions, 1871 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:49,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:49,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-05 18:36:49,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:50,980 INFO L130 PetriNetUnfolder]: 3276/6636 cut-off events. [2022-12-05 18:36:50,980 INFO L131 PetriNetUnfolder]: For 96090/99473 co-relation queries the response was YES. [2022-12-05 18:36:51,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31337 conditions, 6636 events. 3276/6636 cut-off events. For 96090/99473 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 57682 event pairs, 139 based on Foata normal form. 631/6856 useless extension candidates. Maximal degree in co-relation 31239. Up to 2096 conditions per place. [2022-12-05 18:36:51,164 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 146 selfloop transitions, 7 changer transitions 154/403 dead transitions. [2022-12-05 18:36:51,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 403 transitions, 6467 flow [2022-12-05 18:36:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:36:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:36:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 944 transitions. [2022-12-05 18:36:51,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8581818181818182 [2022-12-05 18:36:51,166 INFO L175 Difference]: Start difference. First operand has 169 places, 176 transitions, 1871 flow. Second operand 10 states and 944 transitions. [2022-12-05 18:36:51,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 403 transitions, 6467 flow [2022-12-05 18:36:51,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 403 transitions, 6334 flow, removed 61 selfloop flow, removed 7 redundant places. [2022-12-05 18:36:51,239 INFO L231 Difference]: Finished difference. Result has 168 places, 171 transitions, 1704 flow [2022-12-05 18:36:51,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1704, PETRI_PLACES=168, PETRI_TRANSITIONS=171} [2022-12-05 18:36:51,240 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 53 predicate places. [2022-12-05 18:36:51,241 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 171 transitions, 1704 flow [2022-12-05 18:36:51,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:51,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:51,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:51,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:36:51,242 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash -568497268, now seen corresponding path program 1 times [2022-12-05 18:36:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:51,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388059990] [2022-12-05 18:36:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:51,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388059990] [2022-12-05 18:36:51,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388059990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:51,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:51,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:36:51,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628866903] [2022-12-05 18:36:51,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:51,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:36:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:51,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:36:51,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:36:51,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 110 [2022-12-05 18:36:51,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 171 transitions, 1704 flow. Second operand has 12 states, 12 states have (on average 84.75) internal successors, (1017), 12 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:51,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:51,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 110 [2022-12-05 18:36:51,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:52,605 INFO L130 PetriNetUnfolder]: 795/2973 cut-off events. [2022-12-05 18:36:52,606 INFO L131 PetriNetUnfolder]: For 18593/20618 co-relation queries the response was YES. [2022-12-05 18:36:52,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12393 conditions, 2973 events. 795/2973 cut-off events. For 18593/20618 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30379 event pairs, 233 based on Foata normal form. 188/2933 useless extension candidates. Maximal degree in co-relation 12288. Up to 802 conditions per place. [2022-12-05 18:36:52,643 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 64 selfloop transitions, 33 changer transitions 0/190 dead transitions. [2022-12-05 18:36:52,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 190 transitions, 2205 flow [2022-12-05 18:36:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:36:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:36:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2022-12-05 18:36:52,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7853146853146853 [2022-12-05 18:36:52,645 INFO L175 Difference]: Start difference. First operand has 168 places, 171 transitions, 1704 flow. Second operand 13 states and 1123 transitions. [2022-12-05 18:36:52,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 190 transitions, 2205 flow [2022-12-05 18:36:52,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 190 transitions, 2196 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-05 18:36:52,673 INFO L231 Difference]: Finished difference. Result has 179 places, 182 transitions, 2043 flow [2022-12-05 18:36:52,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2043, PETRI_PLACES=179, PETRI_TRANSITIONS=182} [2022-12-05 18:36:52,674 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 64 predicate places. [2022-12-05 18:36:52,674 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 182 transitions, 2043 flow [2022-12-05 18:36:52,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.75) internal successors, (1017), 12 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:52,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:52,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:52,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:36:52,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash -941484410, now seen corresponding path program 1 times [2022-12-05 18:36:52,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:52,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920269246] [2022-12-05 18:36:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:52,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:52,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920269246] [2022-12-05 18:36:52,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920269246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:52,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:52,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:36:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815786278] [2022-12-05 18:36:52,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:52,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:36:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:52,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:36:52,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:36:52,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-05 18:36:52,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 182 transitions, 2043 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:52,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:52,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-05 18:36:52,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:53,559 INFO L130 PetriNetUnfolder]: 1551/4031 cut-off events. [2022-12-05 18:36:53,560 INFO L131 PetriNetUnfolder]: For 49760/50873 co-relation queries the response was YES. [2022-12-05 18:36:53,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20951 conditions, 4031 events. 1551/4031 cut-off events. For 49760/50873 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 37196 event pairs, 103 based on Foata normal form. 435/4400 useless extension candidates. Maximal degree in co-relation 20846. Up to 1185 conditions per place. [2022-12-05 18:36:53,598 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 115 selfloop transitions, 20 changer transitions 120/350 dead transitions. [2022-12-05 18:36:53,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 350 transitions, 5629 flow [2022-12-05 18:36:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:36:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:36:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1039 transitions. [2022-12-05 18:36:53,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8586776859504133 [2022-12-05 18:36:53,600 INFO L175 Difference]: Start difference. First operand has 179 places, 182 transitions, 2043 flow. Second operand 11 states and 1039 transitions. [2022-12-05 18:36:53,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 350 transitions, 5629 flow [2022-12-05 18:36:53,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 350 transitions, 5276 flow, removed 53 selfloop flow, removed 8 redundant places. [2022-12-05 18:36:53,665 INFO L231 Difference]: Finished difference. Result has 185 places, 170 transitions, 1541 flow [2022-12-05 18:36:53,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1541, PETRI_PLACES=185, PETRI_TRANSITIONS=170} [2022-12-05 18:36:53,666 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 70 predicate places. [2022-12-05 18:36:53,667 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 170 transitions, 1541 flow [2022-12-05 18:36:53,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:53,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:53,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:53,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:36:53,668 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1519937193, now seen corresponding path program 1 times [2022-12-05 18:36:53,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:53,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340072568] [2022-12-05 18:36:53,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:54,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340072568] [2022-12-05 18:36:54,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340072568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:54,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:54,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:36:54,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474530588] [2022-12-05 18:36:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:54,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:36:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:54,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:36:54,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:36:54,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 110 [2022-12-05 18:36:54,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 170 transitions, 1541 flow. Second operand has 8 states, 8 states have (on average 78.375) internal successors, (627), 8 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:54,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:54,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 110 [2022-12-05 18:36:54,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:54,830 INFO L130 PetriNetUnfolder]: 787/3602 cut-off events. [2022-12-05 18:36:54,830 INFO L131 PetriNetUnfolder]: For 15443/16156 co-relation queries the response was YES. [2022-12-05 18:36:54,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13700 conditions, 3602 events. 787/3602 cut-off events. For 15443/16156 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 41251 event pairs, 38 based on Foata normal form. 43/3460 useless extension candidates. Maximal degree in co-relation 13584. Up to 1151 conditions per place. [2022-12-05 18:36:54,905 INFO L137 encePairwiseOnDemand]: 93/110 looper letters, 64 selfloop transitions, 19 changer transitions 91/259 dead transitions. [2022-12-05 18:36:54,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 259 transitions, 3374 flow [2022-12-05 18:36:54,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:36:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:36:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 757 transitions. [2022-12-05 18:36:54,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7646464646464647 [2022-12-05 18:36:54,906 INFO L175 Difference]: Start difference. First operand has 185 places, 170 transitions, 1541 flow. Second operand 9 states and 757 transitions. [2022-12-05 18:36:54,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 259 transitions, 3374 flow [2022-12-05 18:36:55,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 259 transitions, 3093 flow, removed 97 selfloop flow, removed 16 redundant places. [2022-12-05 18:36:55,032 INFO L231 Difference]: Finished difference. Result has 176 places, 147 transitions, 1132 flow [2022-12-05 18:36:55,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1132, PETRI_PLACES=176, PETRI_TRANSITIONS=147} [2022-12-05 18:36:55,033 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 61 predicate places. [2022-12-05 18:36:55,033 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 147 transitions, 1132 flow [2022-12-05 18:36:55,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.375) internal successors, (627), 8 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:55,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:55,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:55,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:36:55,033 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1463374011, now seen corresponding path program 2 times [2022-12-05 18:36:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:55,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846984147] [2022-12-05 18:36:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:55,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846984147] [2022-12-05 18:36:55,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846984147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:55,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:55,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:36:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533662774] [2022-12-05 18:36:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:55,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:36:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:36:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:36:55,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2022-12-05 18:36:55,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 147 transitions, 1132 flow. Second operand has 7 states, 7 states have (on average 80.57142857142857) internal successors, (564), 7 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:55,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:55,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2022-12-05 18:36:55,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:55,784 INFO L130 PetriNetUnfolder]: 435/2176 cut-off events. [2022-12-05 18:36:55,785 INFO L131 PetriNetUnfolder]: For 5883/5974 co-relation queries the response was YES. [2022-12-05 18:36:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6237 conditions, 2176 events. 435/2176 cut-off events. For 5883/5974 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 22885 event pairs, 22 based on Foata normal form. 18/2094 useless extension candidates. Maximal degree in co-relation 6128. Up to 264 conditions per place. [2022-12-05 18:36:55,798 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 44 selfloop transitions, 9 changer transitions 45/183 dead transitions. [2022-12-05 18:36:55,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 183 transitions, 1909 flow [2022-12-05 18:36:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:36:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:36:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 831 transitions. [2022-12-05 18:36:55,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7554545454545455 [2022-12-05 18:36:55,799 INFO L175 Difference]: Start difference. First operand has 176 places, 147 transitions, 1132 flow. Second operand 10 states and 831 transitions. [2022-12-05 18:36:55,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 183 transitions, 1909 flow [2022-12-05 18:36:55,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 183 transitions, 1741 flow, removed 44 selfloop flow, removed 16 redundant places. [2022-12-05 18:36:55,819 INFO L231 Difference]: Finished difference. Result has 171 places, 133 transitions, 823 flow [2022-12-05 18:36:55,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=823, PETRI_PLACES=171, PETRI_TRANSITIONS=133} [2022-12-05 18:36:55,819 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 56 predicate places. [2022-12-05 18:36:55,819 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 133 transitions, 823 flow [2022-12-05 18:36:55,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.57142857142857) internal successors, (564), 7 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:55,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:55,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:55,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 18:36:55,820 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash -35011863, now seen corresponding path program 1 times [2022-12-05 18:36:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529940276] [2022-12-05 18:36:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:36:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:36:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:36:55,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529940276] [2022-12-05 18:36:55,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529940276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:36:55,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:36:55,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:36:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786544496] [2022-12-05 18:36:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:36:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:36:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:36:55,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:36:55,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:36:55,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-05 18:36:55,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 133 transitions, 823 flow. Second operand has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:55,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:36:55,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-05 18:36:55,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:36:56,291 INFO L130 PetriNetUnfolder]: 534/2090 cut-off events. [2022-12-05 18:36:56,292 INFO L131 PetriNetUnfolder]: For 17317/17551 co-relation queries the response was YES. [2022-12-05 18:36:56,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7828 conditions, 2090 events. 534/2090 cut-off events. For 17317/17551 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20456 event pairs, 39 based on Foata normal form. 147/2212 useless extension candidates. Maximal degree in co-relation 7785. Up to 262 conditions per place. [2022-12-05 18:36:56,300 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 20 selfloop transitions, 12 changer transitions 82/188 dead transitions. [2022-12-05 18:36:56,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 188 transitions, 1839 flow [2022-12-05 18:36:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:36:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:36:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1286 transitions. [2022-12-05 18:36:56,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8350649350649351 [2022-12-05 18:36:56,303 INFO L175 Difference]: Start difference. First operand has 171 places, 133 transitions, 823 flow. Second operand 14 states and 1286 transitions. [2022-12-05 18:36:56,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 188 transitions, 1839 flow [2022-12-05 18:36:56,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 188 transitions, 1535 flow, removed 106 selfloop flow, removed 16 redundant places. [2022-12-05 18:36:56,320 INFO L231 Difference]: Finished difference. Result has 168 places, 100 transitions, 433 flow [2022-12-05 18:36:56,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=433, PETRI_PLACES=168, PETRI_TRANSITIONS=100} [2022-12-05 18:36:56,321 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 53 predicate places. [2022-12-05 18:36:56,321 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 100 transitions, 433 flow [2022-12-05 18:36:56,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:36:56,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:36:56,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:56,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 18:36:56,321 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:36:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:36:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1338121315, now seen corresponding path program 1 times [2022-12-05 18:36:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:36:56,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479634593] [2022-12-05 18:36:56,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:36:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:36:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:36:56,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:36:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:36:56,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:36:56,383 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:36:56,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 18:36:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 18:36:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 18:36:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 18:36:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 18:36:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 18:36:56,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 18:36:56,386 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:36:56,389 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:36:56,390 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:36:56,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:36:56 BasicIcfg [2022-12-05 18:36:56,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:36:56,472 INFO L158 Benchmark]: Toolchain (without parser) took 19827.09ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 157.9MB in the beginning and 1.0GB in the end (delta: -850.1MB). Peak memory consumption was 207.0MB. Max. memory is 8.0GB. [2022-12-05 18:36:56,472 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:36:56,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.47ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 131.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 18:36:56,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.78ms. Allocated memory is still 183.5MB. Free memory was 131.3MB in the beginning and 128.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 18:36:56,473 INFO L158 Benchmark]: Boogie Preprocessor took 33.11ms. Allocated memory is still 183.5MB. Free memory was 128.7MB in the beginning and 126.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:36:56,473 INFO L158 Benchmark]: RCFGBuilder took 539.02ms. Allocated memory is still 183.5MB. Free memory was 126.6MB in the beginning and 95.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 18:36:56,474 INFO L158 Benchmark]: TraceAbstraction took 18708.82ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 94.1MB in the beginning and 1.0GB in the end (delta: -913.9MB). Peak memory consumption was 143.1MB. Max. memory is 8.0GB. [2022-12-05 18:36:56,475 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.13ms. Allocated memory is still 183.5MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 499.47ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 131.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.78ms. Allocated memory is still 183.5MB. Free memory was 131.3MB in the beginning and 128.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.11ms. Allocated memory is still 183.5MB. Free memory was 128.7MB in the beginning and 126.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.02ms. Allocated memory is still 183.5MB. Free memory was 126.6MB in the beginning and 95.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18708.82ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 94.1MB in the beginning and 1.0GB in the end (delta: -913.9MB). Peak memory consumption was 143.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1196; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-2, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 947 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 947 mSDsluCounter, 1326 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1048 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1993 IncrementalHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 278 mSDtfsCounter, 1993 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2043occurred in iteration=12, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1206 ConstructedInterpolants, 0 QuantifiedInterpolants, 6940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 18:36:56,510 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...