/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 --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:31:57,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:31:57,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:31:57,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:31:57,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:31:57,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:31:57,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:31:57,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:31:57,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:31:57,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:31:57,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:31:57,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:31:57,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:31:57,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:31:57,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:31:57,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:31:57,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:31:57,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:31:57,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:31:57,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:31:57,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:31:57,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:31:57,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:31:57,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:31:57,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:31:57,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:31:57,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:31:57,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:31:57,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:31:57,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:31:57,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:31:57,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:31:57,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:31:57,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:31:57,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:31:57,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:31:57,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:31:57,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:31:57,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:31:57,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:31:57,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:31:57,076 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-11 23:31:57,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:31:57,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:31:57,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:31:57,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:31:57,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:31:57,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:31:57,094 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:31:57,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:31:57,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:31:57,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:31:57,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:31:57,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:31:57,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:31:57,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:31:57,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:31:57,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:31:57,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:31:57,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:31:57,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:31:57,097 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:31:57,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:31:57,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:31:57,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:31:57,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:31:57,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:31:57,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:31:57,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:31:57,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:31:57,356 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:31:57,357 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-11 23:31:58,330 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:31:58,576 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:31:58,576 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-11 23:31:58,598 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc431bcbc/952ccfb2af73443b858b7419d72822bf/FLAG4987d5b67 [2022-12-11 23:31:58,609 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc431bcbc/952ccfb2af73443b858b7419d72822bf [2022-12-11 23:31:58,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:31:58,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:31:58,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:31:58,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:31:58,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:31:58,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:31:58" (1/1) ... [2022-12-11 23:31:58,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22dd1ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:58, skipping insertion in model container [2022-12-11 23:31:58,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:31:58" (1/1) ... [2022-12-11 23:31:58,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:31:58,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:31:58,783 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/mix013.opt.i[944,957] [2022-12-11 23:31:58,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:31:58,910 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:31:58,925 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/mix013.opt.i[944,957] [2022-12-11 23:31:58,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:31:58,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:31:58,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:31:59,018 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:31:59,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59 WrapperNode [2022-12-11 23:31:59,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:31:59,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:31:59,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:31:59,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:31:59,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,093 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-11 23:31:59,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:31:59,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:31:59,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:31:59,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:31:59,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,116 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:31:59,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:31:59,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:31:59,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:31:59,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (1/1) ... [2022-12-11 23:31:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:31:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:31:59,152 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-11 23:31:59,154 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-11 23:31:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:31:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:31:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:31:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:31:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:31:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:31:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:31:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:31:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:31:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:31:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:31:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 23:31:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 23:31:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:31:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:31:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:31:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:31:59,181 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:31:59,303 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:31:59,304 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:31:59,545 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:31:59,667 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:31:59,667 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:31:59,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:31:59 BoogieIcfgContainer [2022-12-11 23:31:59,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:31:59,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:31:59,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:31:59,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:31:59,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:31:58" (1/3) ... [2022-12-11 23:31:59,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fa7ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:31:59, skipping insertion in model container [2022-12-11 23:31:59,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:31:59" (2/3) ... [2022-12-11 23:31:59,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fa7ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:31:59, skipping insertion in model container [2022-12-11 23:31:59,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:31:59" (3/3) ... [2022-12-11 23:31:59,679 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2022-12-11 23:31:59,694 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:31:59,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:31:59,695 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:31:59,748 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:31:59,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-11 23:31:59,841 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-11 23:31:59,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:31:59,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-11 23:31:59,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-11 23:31:59,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-11 23:31:59,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:31:59,867 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;@62ba785e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:31:59,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 23:31:59,902 INFO L130 PetriNetUnfolder]: 0/90 cut-off events. [2022-12-11 23:31:59,902 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:31:59,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:31:59,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:31:59,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:31:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:31:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1959417499, now seen corresponding path program 1 times [2022-12-11 23:31:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:31:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121524732] [2022-12-11 23:31:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:31:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:00,494 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-11 23:32:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:00,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121524732] [2022-12-11 23:32:00,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121524732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:00,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:00,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:32:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496040752] [2022-12-11 23:32:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:00,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:32:00,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:00,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:32:00,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:32:00,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 131 [2022-12-11 23:32:00,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-11 23:32:00,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:00,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 131 [2022-12-11 23:32:00,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:00,608 INFO L130 PetriNetUnfolder]: 14/166 cut-off events. [2022-12-11 23:32:00,609 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 23:32:00,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 166 events. 14/166 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 288 event pairs, 2 based on Foata normal form. 7/164 useless extension candidates. Maximal degree in co-relation 160. Up to 25 conditions per place. [2022-12-11 23:32:00,613 INFO L137 encePairwiseOnDemand]: 126/131 looper letters, 10 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2022-12-11 23:32:00,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 125 transitions, 286 flow [2022-12-11 23:32:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:32:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:32:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2022-12-11 23:32:00,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9363867684478372 [2022-12-11 23:32:00,633 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2022-12-11 23:32:00,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 125 transitions, 286 flow [2022-12-11 23:32:00,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 125 transitions, 286 flow [2022-12-11 23:32:00,636 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 125 transitions, 286 flow [2022-12-11 23:32:00,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-11 23:32:00,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:00,637 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:00,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:32:00,638 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1465376750, now seen corresponding path program 1 times [2022-12-11 23:32:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:00,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293035899] [2022-12-11 23:32:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:01,013 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-11 23:32:01,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:01,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293035899] [2022-12-11 23:32:01,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293035899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:01,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:01,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:32:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550934949] [2022-12-11 23:32:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:01,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:32:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:01,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:32:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:32:01,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-12-11 23:32:01,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 125 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 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-11 23:32:01,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:01,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-12-11 23:32:01,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:01,623 INFO L130 PetriNetUnfolder]: 1473/3265 cut-off events. [2022-12-11 23:32:01,624 INFO L131 PetriNetUnfolder]: For 552/1104 co-relation queries the response was YES. [2022-12-11 23:32:01,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6180 conditions, 3265 events. 1473/3265 cut-off events. For 552/1104 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 24422 event pairs, 253 based on Foata normal form. 1/3188 useless extension candidates. Maximal degree in co-relation 6114. Up to 952 conditions per place. [2022-12-11 23:32:01,642 INFO L137 encePairwiseOnDemand]: 123/131 looper letters, 28 selfloop transitions, 4 changer transitions 60/178 dead transitions. [2022-12-11 23:32:01,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 178 transitions, 594 flow [2022-12-11 23:32:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:32:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:32:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1088 transitions. [2022-12-11 23:32:01,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8305343511450382 [2022-12-11 23:32:01,647 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 9 predicate places. [2022-12-11 23:32:01,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 178 transitions, 594 flow [2022-12-11 23:32:01,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 118 transitions, 340 flow [2022-12-11 23:32:01,656 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 118 transitions, 340 flow [2022-12-11 23:32:01,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 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-11 23:32:01,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:01,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:01,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:32:01,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1598139204, now seen corresponding path program 1 times [2022-12-11 23:32:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:01,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777059291] [2022-12-11 23:32:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:01,886 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-11 23:32:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:01,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777059291] [2022-12-11 23:32:01,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777059291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:01,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:01,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:32:01,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974935014] [2022-12-11 23:32:01,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:32:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:32:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:32:01,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 131 [2022-12-11 23:32:01,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 118 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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-11 23:32:01,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:01,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 131 [2022-12-11 23:32:01,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:02,235 INFO L130 PetriNetUnfolder]: 837/1600 cut-off events. [2022-12-11 23:32:02,236 INFO L131 PetriNetUnfolder]: For 763/2531 co-relation queries the response was YES. [2022-12-11 23:32:02,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 1600 events. 837/1600 cut-off events. For 763/2531 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9061 event pairs, 253 based on Foata normal form. 36/1577 useless extension candidates. Maximal degree in co-relation 4043. Up to 1068 conditions per place. [2022-12-11 23:32:02,245 INFO L137 encePairwiseOnDemand]: 125/131 looper letters, 30 selfloop transitions, 3 changer transitions 22/151 dead transitions. [2022-12-11 23:32:02,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 151 transitions, 634 flow [2022-12-11 23:32:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:32:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:32:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1029 transitions. [2022-12-11 23:32:02,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8727735368956743 [2022-12-11 23:32:02,252 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, -1 predicate places. [2022-12-11 23:32:02,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 151 transitions, 634 flow [2022-12-11 23:32:02,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 129 transitions, 478 flow [2022-12-11 23:32:02,261 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 478 flow [2022-12-11 23:32:02,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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-11 23:32:02,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:02,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:02,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:32:02,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash 728996649, now seen corresponding path program 1 times [2022-12-11 23:32:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:02,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854007178] [2022-12-11 23:32:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:02,543 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-11 23:32:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:02,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854007178] [2022-12-11 23:32:02,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854007178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:02,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:02,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:32:02,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736768563] [2022-12-11 23:32:02,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:02,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:32:02,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:32:02,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:32:02,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2022-12-11 23:32:02,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 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-11 23:32:02,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:02,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2022-12-11 23:32:02,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:03,604 INFO L130 PetriNetUnfolder]: 5182/8804 cut-off events. [2022-12-11 23:32:03,605 INFO L131 PetriNetUnfolder]: For 14796/15225 co-relation queries the response was YES. [2022-12-11 23:32:03,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25242 conditions, 8804 events. 5182/8804 cut-off events. For 14796/15225 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 65094 event pairs, 390 based on Foata normal form. 1/8294 useless extension candidates. Maximal degree in co-relation 25168. Up to 2922 conditions per place. [2022-12-11 23:32:03,657 INFO L137 encePairwiseOnDemand]: 120/131 looper letters, 140 selfloop transitions, 20 changer transitions 2/255 dead transitions. [2022-12-11 23:32:03,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 255 transitions, 1603 flow [2022-12-11 23:32:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:32:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:32:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1151 transitions. [2022-12-11 23:32:03,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8786259541984733 [2022-12-11 23:32:03,661 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2022-12-11 23:32:03,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 255 transitions, 1603 flow [2022-12-11 23:32:03,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 253 transitions, 1583 flow [2022-12-11 23:32:03,702 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 253 transitions, 1583 flow [2022-12-11 23:32:03,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 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-11 23:32:03,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:03,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:03,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:32:03,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -779760832, now seen corresponding path program 1 times [2022-12-11 23:32:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:03,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835838885] [2022-12-11 23:32:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:03,891 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-11 23:32:03,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:03,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835838885] [2022-12-11 23:32:03,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835838885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:03,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:03,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:32:03,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518810533] [2022-12-11 23:32:03,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:03,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:32:03,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:32:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:32:03,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2022-12-11 23:32:03,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 253 transitions, 1583 flow. Second operand has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 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-11 23:32:03,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:03,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2022-12-11 23:32:03,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:05,058 INFO L130 PetriNetUnfolder]: 4642/8757 cut-off events. [2022-12-11 23:32:05,059 INFO L131 PetriNetUnfolder]: For 15834/16785 co-relation queries the response was YES. [2022-12-11 23:32:05,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30054 conditions, 8757 events. 4642/8757 cut-off events. For 15834/16785 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 72995 event pairs, 214 based on Foata normal form. 187/8512 useless extension candidates. Maximal degree in co-relation 29976. Up to 2453 conditions per place. [2022-12-11 23:32:05,106 INFO L137 encePairwiseOnDemand]: 120/131 looper letters, 256 selfloop transitions, 54 changer transitions 22/425 dead transitions. [2022-12-11 23:32:05,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 425 transitions, 3634 flow [2022-12-11 23:32:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:32:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:32:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1500 transitions. [2022-12-11 23:32:05,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8807985907222549 [2022-12-11 23:32:05,109 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 14 predicate places. [2022-12-11 23:32:05,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 425 transitions, 3634 flow [2022-12-11 23:32:05,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 403 transitions, 3382 flow [2022-12-11 23:32:05,138 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 403 transitions, 3382 flow [2022-12-11 23:32:05,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 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-11 23:32:05,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:05,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:05,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:32:05,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 781137804, now seen corresponding path program 1 times [2022-12-11 23:32:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:05,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476914032] [2022-12-11 23:32:05,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:05,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:05,368 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-11 23:32:05,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:05,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476914032] [2022-12-11 23:32:05,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476914032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:05,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:05,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:32:05,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427485473] [2022-12-11 23:32:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:05,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:32:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:05,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:32:05,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:32:05,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2022-12-11 23:32:05,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 403 transitions, 3382 flow. Second operand has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 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-11 23:32:05,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:05,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2022-12-11 23:32:05,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:05,990 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][149], [20#L783true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 95#L806true, 125#L760true, P3Thread1of1ForFork2InUse, 150#(= ~__unbuffered_p3_EAX~0 0), 17#$Ultimate##0true, 147#(= ~z$w_buff0_used~0 0), 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true, 58#L3true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:05,990 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 23:32:05,990 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 23:32:05,990 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 23:32:05,990 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 23:32:06,065 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L816-->L828: Formula: (and (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~z$r_buff0_thd0~0_29 v_~z$r_buff1_thd0~0_27) (= v_~z$w_buff0~0_72 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_139 256) 0)))) 1 0)) (= v_~z$r_buff0_thd1~0_13 v_~z$r_buff1_thd1~0_13) (= v_~z$w_buff0~0_73 v_~z$w_buff1~0_69) (= v_~z$w_buff0_used~0_139 1) (= v_~z$w_buff0_used~0_140 v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_15) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_59) (= v_~z$r_buff0_thd4~0_74 1) (= v_~z$r_buff0_thd4~0_75 v_~z$r_buff1_thd4~0_67)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_140, ~z$w_buff0~0=v_~z$w_buff0~0_73, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~z$w_buff0~0=v_~z$w_buff0~0_72, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_59, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_69, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1][146], [145#true, 41#L828true, 213#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L778true, P0Thread1of1ForFork1InUse, 95#L806true, 125#L760true, 150#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork2InUse, 194#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true, 58#L3true]) [2022-12-11 23:32:06,066 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,066 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,066 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,066 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,066 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][149], [132#L3-1true, 20#L783true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 95#L806true, P0Thread1of1ForFork1InUse, 125#L760true, 150#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork2InUse, 17#$Ultimate##0true, 147#(= ~z$w_buff0_used~0 0), 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:06,066 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,066 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,066 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,067 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,067 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][217], [20#L783true, 104#L811true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 219#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#L760true, P3Thread1of1ForFork2InUse, 150#(= ~__unbuffered_p3_EAX~0 0), 17#$Ultimate##0true, 147#(= ~z$w_buff0_used~0 0), 165#true, 58#L3true, 245#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:06,067 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,067 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,067 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,067 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 23:32:06,149 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L816-->L828: Formula: (and (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~z$r_buff0_thd0~0_29 v_~z$r_buff1_thd0~0_27) (= v_~z$w_buff0~0_72 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_139 256) 0)))) 1 0)) (= v_~z$r_buff0_thd1~0_13 v_~z$r_buff1_thd1~0_13) (= v_~z$w_buff0~0_73 v_~z$w_buff1~0_69) (= v_~z$w_buff0_used~0_139 1) (= v_~z$w_buff0_used~0_140 v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_15) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_59) (= v_~z$r_buff0_thd4~0_74 1) (= v_~z$r_buff0_thd4~0_75 v_~z$r_buff1_thd4~0_67)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_140, ~z$w_buff0~0=v_~z$w_buff0~0_73, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~z$w_buff0~0=v_~z$w_buff0~0_72, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_59, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_69, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1][214], [145#true, 104#L811true, 41#L828true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L778true, P0Thread1of1ForFork1InUse, 125#L760true, 150#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork2InUse, 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true, 58#L3true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:06,149 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,150 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,150 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,150 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,152 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L816-->L828: Formula: (and (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~z$r_buff0_thd0~0_29 v_~z$r_buff1_thd0~0_27) (= v_~z$w_buff0~0_72 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_139 256) 0)))) 1 0)) (= v_~z$r_buff0_thd1~0_13 v_~z$r_buff1_thd1~0_13) (= v_~z$w_buff0~0_73 v_~z$w_buff1~0_69) (= v_~z$w_buff0_used~0_139 1) (= v_~z$w_buff0_used~0_140 v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_15) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_59) (= v_~z$r_buff0_thd4~0_74 1) (= v_~z$r_buff0_thd4~0_75 v_~z$r_buff1_thd4~0_67)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_140, ~z$w_buff0~0=v_~z$w_buff0~0_73, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~z$w_buff0~0=v_~z$w_buff0~0_72, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_59, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_69, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1][146], [132#L3-1true, 145#true, 41#L828true, 213#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L778true, P0Thread1of1ForFork1InUse, 95#L806true, 125#L760true, 150#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork2InUse, 194#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true]) [2022-12-11 23:32:06,152 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,152 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,152 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,152 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,153 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][217], [132#L3-1true, 20#L783true, 104#L811true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 219#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#L760true, 150#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork2InUse, 17#$Ultimate##0true, 147#(= ~z$w_buff0_used~0 0), 165#true, 245#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:06,153 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,153 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,153 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,153 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 23:32:06,274 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([403] L816-->L828: Formula: (and (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~z$r_buff0_thd0~0_29 v_~z$r_buff1_thd0~0_27) (= v_~z$w_buff0~0_72 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_139 256) 0)))) 1 0)) (= v_~z$r_buff0_thd1~0_13 v_~z$r_buff1_thd1~0_13) (= v_~z$w_buff0~0_73 v_~z$w_buff1~0_69) (= v_~z$w_buff0_used~0_139 1) (= v_~z$w_buff0_used~0_140 v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_15) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_59) (= v_~z$r_buff0_thd4~0_74 1) (= v_~z$r_buff0_thd4~0_75 v_~z$r_buff1_thd4~0_67)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_140, ~z$w_buff0~0=v_~z$w_buff0~0_73, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~z$w_buff0~0=v_~z$w_buff0~0_72, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_59, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_69, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_29, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1][214], [132#L3-1true, 145#true, 104#L811true, 41#L828true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L778true, P0Thread1of1ForFork1InUse, 125#L760true, P3Thread1of1ForFork2InUse, 150#(= ~__unbuffered_p3_EAX~0 0), 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:06,275 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:32:06,275 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:06,275 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:06,275 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:06,538 INFO L130 PetriNetUnfolder]: 4208/8256 cut-off events. [2022-12-11 23:32:06,538 INFO L131 PetriNetUnfolder]: For 16797/19899 co-relation queries the response was YES. [2022-12-11 23:32:06,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33969 conditions, 8256 events. 4208/8256 cut-off events. For 16797/19899 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 71197 event pairs, 129 based on Foata normal form. 697/8586 useless extension candidates. Maximal degree in co-relation 33887. Up to 2218 conditions per place. [2022-12-11 23:32:06,590 INFO L137 encePairwiseOnDemand]: 120/131 looper letters, 260 selfloop transitions, 104 changer transitions 84/541 dead transitions. [2022-12-11 23:32:06,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 541 transitions, 5487 flow [2022-12-11 23:32:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:32:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:32:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1848 transitions. [2022-12-11 23:32:06,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8816793893129771 [2022-12-11 23:32:06,594 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 29 predicate places. [2022-12-11 23:32:06,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 541 transitions, 5487 flow [2022-12-11 23:32:06,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 457 transitions, 4563 flow [2022-12-11 23:32:06,625 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 457 transitions, 4563 flow [2022-12-11 23:32:06,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 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-11 23:32:06,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:06,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:06,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:32:06,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1741649652, now seen corresponding path program 1 times [2022-12-11 23:32:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:06,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542548554] [2022-12-11 23:32:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:06,833 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-11 23:32:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:06,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542548554] [2022-12-11 23:32:06,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542548554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:06,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:06,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:32:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790432482] [2022-12-11 23:32:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:06,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:32:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:06,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:32:06,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:32:06,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 131 [2022-12-11 23:32:06,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 457 transitions, 4563 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 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-11 23:32:06,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:06,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 131 [2022-12-11 23:32:06,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:08,023 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L828-->L844: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_63 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse3 (and .cse10 .cse6))) (let ((.cse4 (or .cse1 .cse11 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_111 0))) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p3_EAX~0_14) v_~z~0_94) (= v_~z$mem_tmp~0_30 v_~z~0_95) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_1| v_~weak$$choice0~0_14) (= v_~z$w_buff0~0_59 v_~z$w_buff0~0_58) (= v_~__unbuffered_p3_EAX~0_14 (ite .cse4 v_~z~0_95 (ite .cse5 v_~z$w_buff0~0_59 v_~z$w_buff1~0_58))) (= v_~z$r_buff0_thd4~0_62 (ite .cse0 v_~z$r_buff0_thd4~0_63 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~z$r_buff0_thd4~0_63 (ite (and (not .cse2) .cse8) 0 v_~z$r_buff0_thd4~0_63)))) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse4 v_~z$w_buff0_used~0_124 (ite .cse5 0 v_~z$w_buff0_used~0_124)))) (= v_~z$r_buff1_thd4~0_59 (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd4~0_62 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse7) .cse2)) v_~z$r_buff1_thd4~0_60 0))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_59, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$w_buff1~0=v_~z$w_buff1~0_58, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_62, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0][457], [104#L811true, 145#true, P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 105#L778true, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 252#(= ~a~0 1), P0Thread1of1ForFork1InUse, 125#L760true, P3Thread1of1ForFork2InUse, 181#true, 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 96#L844true, 165#true, 58#L3true]) [2022-12-11 23:32:08,023 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,023 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,023 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,023 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,023 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L760-->L765: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][308], [104#L811true, 145#true, 41#L828true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 105#L778true, P0Thread1of1ForFork1InUse, 219#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 150#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork2InUse, 116#L765true, 181#true, 165#true, 245#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 58#L3true]) [2022-12-11 23:32:08,023 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,023 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,023 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,023 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,064 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L847-->L854: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_48 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256))))) (let ((.cse4 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse1 (and .cse2 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_48) v_~z$r_buff1_thd4~0_47) (= v_~z$w_buff0_used~0_99 (ite .cse4 0 v_~z$w_buff0_used~0_100)) (= v_~z~0_68 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse0 v_~z$w_buff1~0_37 v_~z~0_69))) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_69} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_68} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][442], [24#L854true, 104#L811true, 145#true, 86#L757true, P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 28#L775true, 165#true, 58#L3true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:08,065 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,065 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,065 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,065 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 23:32:08,124 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L828-->L844: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd4~0_63 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse3 (and .cse10 .cse6))) (let ((.cse4 (or .cse1 .cse11 .cse3)) (.cse5 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse2 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_111 0))) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$flush_delayed~0_48 0) (= (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p3_EAX~0_14) v_~z~0_94) (= v_~z$mem_tmp~0_30 v_~z~0_95) (= |v_P3Thread1of1ForFork2_#t~nondet5#1_1| v_~weak$$choice0~0_14) (= v_~z$w_buff0~0_59 v_~z$w_buff0~0_58) (= v_~__unbuffered_p3_EAX~0_14 (ite .cse4 v_~z~0_95 (ite .cse5 v_~z$w_buff0~0_59 v_~z$w_buff1~0_58))) (= v_~z$r_buff0_thd4~0_62 (ite .cse0 v_~z$r_buff0_thd4~0_63 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~z$r_buff0_thd4~0_63 (ite (and (not .cse2) .cse8) 0 v_~z$r_buff0_thd4~0_63)))) (= |v_P3Thread1of1ForFork2_#t~nondet6#1_1| v_~weak$$choice2~0_64) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse4 v_~z$w_buff0_used~0_124 (ite .cse5 0 v_~z$w_buff0_used~0_124)))) (= v_~z$r_buff1_thd4~0_59 (ite .cse0 v_~z$r_buff1_thd4~0_60 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd4~0_62 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse7) .cse2)) v_~z$r_buff1_thd4~0_60 0))))))) InVars {P3Thread1of1ForFork2_#t~nondet5#1=|v_P3Thread1of1ForFork2_#t~nondet5#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_59, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$w_buff1~0=v_~z$w_buff1~0_58, P3Thread1of1ForFork2_#t~nondet6#1=|v_P3Thread1of1ForFork2_#t~nondet6#1_1|, ~z~0=v_~z~0_95} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_48, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_62, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_64} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P3Thread1of1ForFork2_#t~nondet6#1, ~weak$$choice0~0, P3Thread1of1ForFork2_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0][506], [132#L3-1true, 104#L811true, 145#true, P1Thread1of1ForFork3InUse, 148#true, 186#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P2Thread1of1ForFork0InUse, 105#L778true, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 252#(= ~a~0 1), P0Thread1of1ForFork1InUse, 125#L760true, P3Thread1of1ForFork2InUse, 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 96#L844true, 165#true]) [2022-12-11 23:32:08,124 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,125 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,125 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,125 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,125 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L760-->L765: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][365], [132#L3-1true, 104#L811true, 145#true, 41#L828true, P1Thread1of1ForFork3InUse, 186#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 105#L778true, P0Thread1of1ForFork1InUse, 219#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 150#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork2InUse, 116#L765true, 165#true, 245#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:08,125 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,125 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,125 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,125 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,155 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L847-->L854: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_48 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256))))) (let ((.cse4 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse1 (and .cse2 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_48) v_~z$r_buff1_thd4~0_47) (= v_~z$w_buff0_used~0_99 (ite .cse4 0 v_~z$w_buff0_used~0_100)) (= v_~z~0_68 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse0 v_~z$w_buff1~0_37 v_~z~0_69))) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_69} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_68} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][442], [24#L854true, 104#L811true, 145#true, 86#L757true, P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 105#L778true, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 252#(= ~a~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true, 58#L3true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:08,155 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,156 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,156 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,156 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,164 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L847-->L854: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_48 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256))))) (let ((.cse4 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse1 (and .cse2 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_48) v_~z$r_buff1_thd4~0_47) (= v_~z$w_buff0_used~0_99 (ite .cse4 0 v_~z$w_buff0_used~0_100)) (= v_~z~0_68 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse0 v_~z$w_buff1~0_37 v_~z~0_69))) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_69} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_68} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][442], [24#L854true, 132#L3-1true, 104#L811true, 145#true, 86#L757true, P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 252#(= ~a~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 28#L775true, 165#true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:08,165 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,165 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,165 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,165 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:08,234 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L847-->L854: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_48 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256))))) (let ((.cse4 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse1 (and .cse2 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_48) v_~z$r_buff1_thd4~0_47) (= v_~z$w_buff0_used~0_99 (ite .cse4 0 v_~z$w_buff0_used~0_100)) (= v_~z~0_68 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse0 v_~z$w_buff1~0_37 v_~z~0_69))) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_69} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_37, ~z~0=v_~z~0_68} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][442], [24#L854true, 132#L3-1true, 104#L811true, 145#true, 86#L757true, P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 105#L778true, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 241#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 165#true, 196#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:08,234 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 23:32:08,234 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:32:08,234 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:32:08,234 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:32:08,528 INFO L130 PetriNetUnfolder]: 7357/14406 cut-off events. [2022-12-11 23:32:08,528 INFO L131 PetriNetUnfolder]: For 44328/49224 co-relation queries the response was YES. [2022-12-11 23:32:08,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63419 conditions, 14406 events. 7357/14406 cut-off events. For 44328/49224 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 135075 event pairs, 136 based on Foata normal form. 336/14170 useless extension candidates. Maximal degree in co-relation 63327. Up to 3782 conditions per place. [2022-12-11 23:32:08,630 INFO L137 encePairwiseOnDemand]: 117/131 looper letters, 405 selfloop transitions, 43 changer transitions 76/729 dead transitions. [2022-12-11 23:32:08,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 729 transitions, 9176 flow [2022-12-11 23:32:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:32:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:32:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1163 transitions. [2022-12-11 23:32:08,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8070784177654406 [2022-12-11 23:32:08,633 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 39 predicate places. [2022-12-11 23:32:08,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 729 transitions, 9176 flow [2022-12-11 23:32:08,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 653 transitions, 8108 flow [2022-12-11 23:32:08,687 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 653 transitions, 8108 flow [2022-12-11 23:32:08,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 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-11 23:32:08,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:08,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:08,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:32:08,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash -586741354, now seen corresponding path program 2 times [2022-12-11 23:32:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:08,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255198411] [2022-12-11 23:32:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:08,891 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-11 23:32:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255198411] [2022-12-11 23:32:08,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255198411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:08,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:08,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:32:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606974546] [2022-12-11 23:32:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:08,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:32:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:32:08,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:32:08,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 131 [2022-12-11 23:32:08,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 653 transitions, 8108 flow. Second operand has 8 states, 8 states have (on average 102.25) internal successors, (818), 8 states have internal predecessors, (818), 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-11 23:32:08,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:08,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 131 [2022-12-11 23:32:08,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:11,564 INFO L130 PetriNetUnfolder]: 10963/23681 cut-off events. [2022-12-11 23:32:11,565 INFO L131 PetriNetUnfolder]: For 85147/95652 co-relation queries the response was YES. [2022-12-11 23:32:11,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104444 conditions, 23681 events. 10963/23681 cut-off events. For 85147/95652 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 258178 event pairs, 171 based on Foata normal form. 704/23929 useless extension candidates. Maximal degree in co-relation 104342. Up to 6770 conditions per place. [2022-12-11 23:32:11,697 INFO L137 encePairwiseOnDemand]: 121/131 looper letters, 574 selfloop transitions, 8 changer transitions 391/1166 dead transitions. [2022-12-11 23:32:11,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 1166 transitions, 18036 flow [2022-12-11 23:32:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 23:32:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 23:32:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 859 transitions. [2022-12-11 23:32:11,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8196564885496184 [2022-12-11 23:32:11,701 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 40 predicate places. [2022-12-11 23:32:11,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 1166 transitions, 18036 flow [2022-12-11 23:32:11,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 775 transitions, 11245 flow [2022-12-11 23:32:11,756 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 775 transitions, 11245 flow [2022-12-11 23:32:11,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.25) internal successors, (818), 8 states have internal predecessors, (818), 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-11 23:32:11,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:11,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:11,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:32:11,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 628383430, now seen corresponding path program 3 times [2022-12-11 23:32:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:11,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612189737] [2022-12-11 23:32:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:11,944 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-11 23:32:11,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:11,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612189737] [2022-12-11 23:32:11,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612189737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:11,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:11,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:32:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776224512] [2022-12-11 23:32:11,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:11,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:32:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:32:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:32:11,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 131 [2022-12-11 23:32:11,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 775 transitions, 11245 flow. Second operand has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 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-11 23:32:11,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:11,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 131 [2022-12-11 23:32:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:13,759 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][381], [289#(= ~a~0 1), 20#L783true, 145#true, 243#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 95#L806true, 273#(= ~x~0 1), P0Thread1of1ForFork1InUse, 125#L760true, 217#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 38#L882true, 181#true, 67#L857true, 165#true]) [2022-12-11 23:32:13,760 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 23:32:13,760 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:13,760 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:13,760 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 23:32:13,921 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][381], [289#(= ~a~0 1), 20#L783true, 145#true, 70#L2true, 243#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 95#L806true, 273#(= ~x~0 1), P0Thread1of1ForFork1InUse, 125#L760true, 217#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 181#true, 67#L857true, 165#true]) [2022-12-11 23:32:13,921 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 23:32:13,921 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:32:13,921 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:32:13,921 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 23:32:14,039 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][479], [289#(= ~a~0 1), 20#L783true, 145#true, P1Thread1of1ForFork3InUse, 148#true, P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 95#L806true, 273#(= ~x~0 1), P0Thread1of1ForFork1InUse, 219#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#L760true, P3Thread1of1ForFork2InUse, 181#true, 67#L857true, 165#true, 58#L3true, 245#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:14,040 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 23:32:14,040 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:32:14,040 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:32:14,040 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 23:32:14,119 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][543], [289#(= ~a~0 1), 132#L3-1true, 20#L783true, 145#true, P1Thread1of1ForFork3InUse, 186#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 148#true, P2Thread1of1ForFork0InUse, 252#(= ~a~0 1), 95#L806true, 273#(= ~x~0 1), P0Thread1of1ForFork1InUse, 219#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#L760true, P3Thread1of1ForFork2InUse, 67#L857true, 165#true, 245#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 23:32:14,119 INFO L382 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-12-11 23:32:14,119 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 23:32:14,120 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 23:32:14,120 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-11 23:32:14,308 INFO L130 PetriNetUnfolder]: 9174/21779 cut-off events. [2022-12-11 23:32:14,308 INFO L131 PetriNetUnfolder]: For 85107/96860 co-relation queries the response was YES. [2022-12-11 23:32:14,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92775 conditions, 21779 events. 9174/21779 cut-off events. For 85107/96860 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 254818 event pairs, 166 based on Foata normal form. 1067/22326 useless extension candidates. Maximal degree in co-relation 92668. Up to 7334 conditions per place. [2022-12-11 23:32:14,437 INFO L137 encePairwiseOnDemand]: 125/131 looper letters, 366 selfloop transitions, 3 changer transitions 304/877 dead transitions. [2022-12-11 23:32:14,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 877 transitions, 14345 flow [2022-12-11 23:32:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 23:32:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 23:32:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2022-12-11 23:32:14,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8724100327153762 [2022-12-11 23:32:14,440 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 43 predicate places. [2022-12-11 23:32:14,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 877 transitions, 14345 flow [2022-12-11 23:32:14,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 573 transitions, 8474 flow [2022-12-11 23:32:14,486 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 573 transitions, 8474 flow [2022-12-11 23:32:14,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 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-11 23:32:14,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:14,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:14,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:32:14,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1793718588, now seen corresponding path program 4 times [2022-12-11 23:32:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:14,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155549539] [2022-12-11 23:32:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:14,703 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-11 23:32:14,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:14,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155549539] [2022-12-11 23:32:14,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155549539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:14,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:14,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:32:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731174115] [2022-12-11 23:32:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:14,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:32:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:32:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:32:14,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2022-12-11 23:32:14,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 573 transitions, 8474 flow. Second operand has 9 states, 9 states have (on average 108.0) internal successors, (972), 9 states have internal predecessors, (972), 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-11 23:32:14,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:14,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2022-12-11 23:32:14,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:16,974 INFO L130 PetriNetUnfolder]: 4896/12598 cut-off events. [2022-12-11 23:32:16,974 INFO L131 PetriNetUnfolder]: For 56098/66888 co-relation queries the response was YES. [2022-12-11 23:32:17,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62257 conditions, 12598 events. 4896/12598 cut-off events. For 56098/66888 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 142735 event pairs, 124 based on Foata normal form. 1545/13718 useless extension candidates. Maximal degree in co-relation 62146. Up to 3658 conditions per place. [2022-12-11 23:32:17,018 INFO L137 encePairwiseOnDemand]: 120/131 looper letters, 77 selfloop transitions, 45 changer transitions 370/582 dead transitions. [2022-12-11 23:32:17,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 582 transitions, 9502 flow [2022-12-11 23:32:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 23:32:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 23:32:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2149 transitions. [2022-12-11 23:32:17,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8633989554037766 [2022-12-11 23:32:17,025 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 58 predicate places. [2022-12-11 23:32:17,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 582 transitions, 9502 flow [2022-12-11 23:32:17,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 212 transitions, 2277 flow [2022-12-11 23:32:17,040 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 212 transitions, 2277 flow [2022-12-11 23:32:17,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.0) internal successors, (972), 9 states have internal predecessors, (972), 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-11 23:32:17,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:17,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:17,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:32:17,040 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1603469426, now seen corresponding path program 1 times [2022-12-11 23:32:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:17,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762129814] [2022-12-11 23:32:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:17,512 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-11 23:32:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:17,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762129814] [2022-12-11 23:32:17,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762129814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:17,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:17,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:32:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817995235] [2022-12-11 23:32:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:17,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:32:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:17,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:32:17,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:32:17,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 131 [2022-12-11 23:32:17,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 212 transitions, 2277 flow. Second operand has 10 states, 10 states have (on average 105.3) internal successors, (1053), 10 states have internal predecessors, (1053), 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-11 23:32:17,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:17,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 131 [2022-12-11 23:32:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:17,891 INFO L130 PetriNetUnfolder]: 868/3273 cut-off events. [2022-12-11 23:32:17,892 INFO L131 PetriNetUnfolder]: For 17314/19190 co-relation queries the response was YES. [2022-12-11 23:32:17,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15429 conditions, 3273 events. 868/3273 cut-off events. For 17314/19190 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 33533 event pairs, 2 based on Foata normal form. 96/3336 useless extension candidates. Maximal degree in co-relation 15309. Up to 1321 conditions per place. [2022-12-11 23:32:17,903 INFO L137 encePairwiseOnDemand]: 121/131 looper letters, 34 selfloop transitions, 3 changer transitions 125/261 dead transitions. [2022-12-11 23:32:17,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 261 transitions, 3530 flow [2022-12-11 23:32:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:32:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:32:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1070 transitions. [2022-12-11 23:32:17,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.816793893129771 [2022-12-11 23:32:17,906 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 51 predicate places. [2022-12-11 23:32:17,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 261 transitions, 3530 flow [2022-12-11 23:32:17,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 136 transitions, 1144 flow [2022-12-11 23:32:17,911 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 136 transitions, 1144 flow [2022-12-11 23:32:17,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.3) internal successors, (1053), 10 states have internal predecessors, (1053), 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-11 23:32:17,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:17,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:17,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:32:17,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1065169236, now seen corresponding path program 2 times [2022-12-11 23:32:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:17,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096736279] [2022-12-11 23:32:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:32:19,267 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-11 23:32:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:32:19,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096736279] [2022-12-11 23:32:19,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096736279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:32:19,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:32:19,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 23:32:19,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284209289] [2022-12-11 23:32:19,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:32:19,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:32:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:32:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:32:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:32:19,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-12-11 23:32:19,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 136 transitions, 1144 flow. Second operand has 13 states, 13 states have (on average 102.92307692307692) internal successors, (1338), 13 states have internal predecessors, (1338), 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-11 23:32:19,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:32:19,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-12-11 23:32:19,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:32:19,466 INFO L130 PetriNetUnfolder]: 155/681 cut-off events. [2022-12-11 23:32:19,466 INFO L131 PetriNetUnfolder]: For 4598/4682 co-relation queries the response was YES. [2022-12-11 23:32:19,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 681 events. 155/681 cut-off events. For 4598/4682 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4490 event pairs, 0 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 2882. Up to 265 conditions per place. [2022-12-11 23:32:19,468 INFO L137 encePairwiseOnDemand]: 118/131 looper letters, 19 selfloop transitions, 11 changer transitions 17/144 dead transitions. [2022-12-11 23:32:19,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 144 transitions, 1390 flow [2022-12-11 23:32:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:32:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:32:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1446 transitions. [2022-12-11 23:32:19,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7884405670665212 [2022-12-11 23:32:19,471 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 38 predicate places. [2022-12-11 23:32:19,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 144 transitions, 1390 flow [2022-12-11 23:32:19,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 127 transitions, 988 flow [2022-12-11 23:32:19,472 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 127 transitions, 988 flow [2022-12-11 23:32:19,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 102.92307692307692) internal successors, (1338), 13 states have internal predecessors, (1338), 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-11 23:32:19,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:32:19,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:32:19,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:32:19,473 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:32:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:32:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1730322262, now seen corresponding path program 3 times [2022-12-11 23:32:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:32:19,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105481308] [2022-12-11 23:32:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:32:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:32:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:32:19,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:32:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:32:19,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:32:19,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:32:19,582 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 23:32:19,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 23:32:19,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 23:32:19,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 23:32:19,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 23:32:19,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 23:32:19,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 23:32:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:32:19,584 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2022-12-11 23:32:19,588 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:32:19,588 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:32:19,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:32:19 BasicIcfg [2022-12-11 23:32:19,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:32:19,675 INFO L158 Benchmark]: Toolchain (without parser) took 21062.59ms. Allocated memory was 201.3MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 159.2MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-11 23:32:19,675 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:32:19,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.40ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 130.9MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 23:32:19,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.34ms. Allocated memory is still 201.3MB. Free memory was 130.9MB in the beginning and 127.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:32:19,676 INFO L158 Benchmark]: Boogie Preprocessor took 25.50ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:32:19,676 INFO L158 Benchmark]: RCFGBuilder took 551.86ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 87.4MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-11 23:32:19,676 INFO L158 Benchmark]: TraceAbstraction took 20000.21ms. Allocated memory was 201.3MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 85.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-11 23:32:19,677 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 201.3MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.40ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 130.9MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.34ms. Allocated memory is still 201.3MB. Free memory was 130.9MB in the beginning and 127.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.50ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 551.86ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 87.4MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 20000.21ms. Allocated memory was 201.3MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 85.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L720] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L722] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L724] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L725] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L726] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L728] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L732] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L733] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L734] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L735] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L736] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L737] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L738] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L739] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L740] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L741] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L742] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L743] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L744] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L745] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L746] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L747] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L748] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L749] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L750] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L751] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t325; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=-3, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=-2, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=-1, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=50, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 874]: 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: 876]: 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: 872]: 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: 878]: 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 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 877 mSDsluCounter, 684 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 547 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1620 IncrementalHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 137 mSDtfsCounter, 1620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11245occurred in iteration=8, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 25349 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1211 NumberOfCodeBlocks, 1211 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1097 ConstructedInterpolants, 0 QuantifiedInterpolants, 6374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11 23:32:19,689 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...