/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_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 12:00:38,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 12:00:38,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 12:00:38,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 12:00:38,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 12:00:38,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 12:00:38,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 12:00:38,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 12:00:38,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 12:00:38,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 12:00:38,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 12:00:38,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 12:00:38,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 12:00:38,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 12:00:38,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 12:00:38,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 12:00:38,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 12:00:38,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 12:00:38,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 12:00:38,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 12:00:38,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 12:00:38,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 12:00:38,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 12:00:38,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 12:00:38,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 12:00:38,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 12:00:38,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 12:00:38,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 12:00:38,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 12:00:38,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 12:00:38,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 12:00:38,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 12:00:38,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 12:00:38,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 12:00:38,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 12:00:38,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 12:00:38,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 12:00:38,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 12:00:38,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 12:00:38,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 12:00:38,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 12:00:38,899 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-12 12:00:38,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 12:00:38,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 12:00:38,926 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 12:00:38,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 12:00:38,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 12:00:38,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 12:00:38,927 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 12:00:38,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 12:00:38,928 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 12:00:38,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 12:00:38,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 12:00:38,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 12:00:38,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 12:00:38,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:00:38,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 12:00:38,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 12:00:38,930 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_REDUNDANT_FLOW [2022-12-12 12:00:39,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 12:00:39,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 12:00:39,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 12:00:39,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 12:00:39,277 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 12:00:39,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-12 12:00:40,582 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 12:00:40,861 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 12:00:40,861 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-12 12:00:40,885 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc97e9ba/860b8ec8e0cb4a86ae5a3ec4cd9bf96a/FLAGc49bbc807 [2022-12-12 12:00:40,895 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc97e9ba/860b8ec8e0cb4a86ae5a3ec4cd9bf96a [2022-12-12 12:00:40,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 12:00:40,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 12:00:40,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 12:00:40,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 12:00:40,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 12:00:40,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:00:40" (1/1) ... [2022-12-12 12:00:40,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcce900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:40, skipping insertion in model container [2022-12-12 12:00:40,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:00:40" (1/1) ... [2022-12-12 12:00:40,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 12:00:40,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 12:00:41,121 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-12 12:00:41,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:00:41,319 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 12:00:41,329 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-12 12:00:41,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:00:41,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:00:41,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:00:41,415 INFO L208 MainTranslator]: Completed translation [2022-12-12 12:00:41,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41 WrapperNode [2022-12-12 12:00:41,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 12:00:41,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 12:00:41,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 12:00:41,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 12:00:41,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,472 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-12 12:00:41,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 12:00:41,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 12:00:41,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 12:00:41,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 12:00:41,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,502 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 12:00:41,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 12:00:41,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 12:00:41,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 12:00:41,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (1/1) ... [2022-12-12 12:00:41,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:00:41,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:00:41,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 12:00:41,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 12:00:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 12:00:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 12:00:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 12:00:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 12:00:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 12:00:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 12:00:41,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 12:00:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 12:00:41,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 12:00:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 12:00:41,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 12:00:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 12:00:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 12:00:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 12:00:41,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 12:00:41,624 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 12:00:41,747 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 12:00:41,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 12:00:41,956 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 12:00:42,082 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 12:00:42,082 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 12:00:42,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:00:42 BoogieIcfgContainer [2022-12-12 12:00:42,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 12:00:42,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 12:00:42,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 12:00:42,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 12:00:42,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:00:40" (1/3) ... [2022-12-12 12:00:42,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bee3b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:00:42, skipping insertion in model container [2022-12-12 12:00:42,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:00:41" (2/3) ... [2022-12-12 12:00:42,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bee3b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:00:42, skipping insertion in model container [2022-12-12 12:00:42,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:00:42" (3/3) ... [2022-12-12 12:00:42,090 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-12 12:00:42,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 12:00:42,103 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 12:00:42,103 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 12:00:42,144 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 12:00:42,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 12:00:42,225 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-12 12:00:42,226 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:00:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 12:00:42,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 12:00:42,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-12 12:00:42,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 12:00:42,255 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;@2e4ce59f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 12:00:42,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 12:00:42,271 INFO L130 PetriNetUnfolder]: 0/57 cut-off events. [2022-12-12 12:00:42,271 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:00:42,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:42,271 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] [2022-12-12 12:00:42,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:42,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1531857526, now seen corresponding path program 1 times [2022-12-12 12:00:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:42,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006188058] [2022-12-12 12:00:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006188058] [2022-12-12 12:00:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006188058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:42,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:42,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 12:00:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177250785] [2022-12-12 12:00:42,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:42,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:00:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:00:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:00:42,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 108 [2022-12-12 12:00:42,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:42,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:42,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 108 [2022-12-12 12:00:42,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:42,981 INFO L130 PetriNetUnfolder]: 37/216 cut-off events. [2022-12-12 12:00:42,981 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-12 12:00:42,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 216 events. 37/216 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 701 event pairs, 7 based on Foata normal form. 13/214 useless extension candidates. Maximal degree in co-relation 259. Up to 51 conditions per place. [2022-12-12 12:00:42,985 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 11 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-12 12:00:42,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 105 transitions, 248 flow [2022-12-12 12:00:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:00:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:00:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-12-12 12:00:42,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-12-12 12:00:43,000 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 0 predicate places. [2022-12-12 12:00:43,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 105 transitions, 248 flow [2022-12-12 12:00:43,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 105 transitions, 242 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-12 12:00:43,005 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 105 transitions, 242 flow [2022-12-12 12:00:43,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:43,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:43,006 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-12 12:00:43,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 12:00:43,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:43,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:43,007 INFO L85 PathProgramCache]: Analyzing trace with hash 540807915, now seen corresponding path program 1 times [2022-12-12 12:00:43,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:43,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932659177] [2022-12-12 12:00:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:43,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:43,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932659177] [2022-12-12 12:00:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932659177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:43,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:43,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:00:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228173224] [2022-12-12 12:00:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:43,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:00:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:43,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:00:43,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:00:43,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2022-12-12 12:00:43,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:43,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:43,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2022-12-12 12:00:43,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:43,871 INFO L130 PetriNetUnfolder]: 618/1783 cut-off events. [2022-12-12 12:00:43,872 INFO L131 PetriNetUnfolder]: For 415/570 co-relation queries the response was YES. [2022-12-12 12:00:43,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 1783 events. 618/1783 cut-off events. For 415/570 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13195 event pairs, 160 based on Foata normal form. 0/1729 useless extension candidates. Maximal degree in co-relation 3233. Up to 570 conditions per place. [2022-12-12 12:00:43,887 INFO L137 encePairwiseOnDemand]: 99/108 looper letters, 27 selfloop transitions, 5 changer transitions 55/159 dead transitions. [2022-12-12 12:00:43,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 159 transitions, 574 flow [2022-12-12 12:00:43,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:00:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:00:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2022-12-12 12:00:43,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8477366255144033 [2022-12-12 12:00:43,892 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 5 predicate places. [2022-12-12 12:00:43,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 159 transitions, 574 flow [2022-12-12 12:00:43,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 159 transitions, 570 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 12:00:43,899 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 159 transitions, 570 flow [2022-12-12 12:00:43,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:43,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:43,899 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] [2022-12-12 12:00:43,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 12:00:43,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1691398818, now seen corresponding path program 1 times [2022-12-12 12:00:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203638092] [2022-12-12 12:00:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:44,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:44,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203638092] [2022-12-12 12:00:44,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203638092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:44,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:44,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:00:44,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567899454] [2022-12-12 12:00:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:44,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:00:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:00:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:00:44,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2022-12-12 12:00:44,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 159 transitions, 570 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:44,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:44,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2022-12-12 12:00:44,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:44,485 INFO L130 PetriNetUnfolder]: 693/1935 cut-off events. [2022-12-12 12:00:44,486 INFO L131 PetriNetUnfolder]: For 683/1343 co-relation queries the response was YES. [2022-12-12 12:00:44,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4754 conditions, 1935 events. 693/1935 cut-off events. For 683/1343 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14608 event pairs, 66 based on Foata normal form. 4/1898 useless extension candidates. Maximal degree in co-relation 4698. Up to 699 conditions per place. [2022-12-12 12:00:44,495 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 33 selfloop transitions, 5 changer transitions 113/223 dead transitions. [2022-12-12 12:00:44,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 223 transitions, 1206 flow [2022-12-12 12:00:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 12:00:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 12:00:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 906 transitions. [2022-12-12 12:00:44,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8388888888888889 [2022-12-12 12:00:44,498 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 14 predicate places. [2022-12-12 12:00:44,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 223 transitions, 1206 flow [2022-12-12 12:00:44,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 223 transitions, 1148 flow, removed 28 selfloop flow, removed 1 redundant places. [2022-12-12 12:00:44,503 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 223 transitions, 1148 flow [2022-12-12 12:00:44,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:44,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:44,504 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] [2022-12-12 12:00:44,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 12:00:44,504 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1418366410, now seen corresponding path program 1 times [2022-12-12 12:00:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:44,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596200634] [2022-12-12 12:00:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:44,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596200634] [2022-12-12 12:00:44,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596200634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:44,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:44,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:00:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318578375] [2022-12-12 12:00:44,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:44,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:00:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:44,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:00:44,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:00:44,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2022-12-12 12:00:44,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 223 transitions, 1148 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:44,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:44,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2022-12-12 12:00:44,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:45,095 INFO L130 PetriNetUnfolder]: 768/2214 cut-off events. [2022-12-12 12:00:45,095 INFO L131 PetriNetUnfolder]: For 960/1952 co-relation queries the response was YES. [2022-12-12 12:00:45,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 2214 events. 768/2214 cut-off events. For 960/1952 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17636 event pairs, 41 based on Foata normal form. 9/2186 useless extension candidates. Maximal degree in co-relation 5998. Up to 559 conditions per place. [2022-12-12 12:00:45,104 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 41 selfloop transitions, 3 changer transitions 171/287 dead transitions. [2022-12-12 12:00:45,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 287 transitions, 1944 flow [2022-12-12 12:00:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:00:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:00:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2022-12-12 12:00:45,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8477366255144033 [2022-12-12 12:00:45,108 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 21 predicate places. [2022-12-12 12:00:45,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 287 transitions, 1944 flow [2022-12-12 12:00:45,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 287 transitions, 1805 flow, removed 67 selfloop flow, removed 1 redundant places. [2022-12-12 12:00:45,115 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 287 transitions, 1805 flow [2022-12-12 12:00:45,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:45,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:45,115 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] [2022-12-12 12:00:45,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 12:00:45,116 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 513883349, now seen corresponding path program 1 times [2022-12-12 12:00:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:45,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964825211] [2022-12-12 12:00:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:45,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:45,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964825211] [2022-12-12 12:00:45,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964825211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:45,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:45,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:00:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619770388] [2022-12-12 12:00:45,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:45,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:00:45,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:00:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:00:45,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-12 12:00:45,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 287 transitions, 1805 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:45,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:45,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-12 12:00:45,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:46,145 INFO L130 PetriNetUnfolder]: 1637/4905 cut-off events. [2022-12-12 12:00:46,146 INFO L131 PetriNetUnfolder]: For 2725/4355 co-relation queries the response was YES. [2022-12-12 12:00:46,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14388 conditions, 4905 events. 1637/4905 cut-off events. For 2725/4355 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 47686 event pairs, 54 based on Foata normal form. 25/4861 useless extension candidates. Maximal degree in co-relation 14328. Up to 1182 conditions per place. [2022-12-12 12:00:46,168 INFO L137 encePairwiseOnDemand]: 96/108 looper letters, 66 selfloop transitions, 15 changer transitions 416/567 dead transitions. [2022-12-12 12:00:46,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 567 transitions, 4907 flow [2022-12-12 12:00:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 12:00:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 12:00:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1536 transitions. [2022-12-12 12:00:46,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2022-12-12 12:00:46,172 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 36 predicate places. [2022-12-12 12:00:46,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 567 transitions, 4907 flow [2022-12-12 12:00:46,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 567 transitions, 4557 flow, removed 175 selfloop flow, removed 0 redundant places. [2022-12-12 12:00:46,188 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 567 transitions, 4557 flow [2022-12-12 12:00:46,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:46,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:46,189 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] [2022-12-12 12:00:46,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 12:00:46,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -270432599, now seen corresponding path program 2 times [2022-12-12 12:00:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:46,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340586732] [2022-12-12 12:00:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:46,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340586732] [2022-12-12 12:00:46,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340586732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:46,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:46,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:00:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407416658] [2022-12-12 12:00:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:46,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:00:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:00:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:00:46,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-12 12:00:46,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 567 transitions, 4557 flow. Second operand has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:46,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:46,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-12 12:00:46,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:47,227 INFO L130 PetriNetUnfolder]: 1765/5402 cut-off events. [2022-12-12 12:00:47,227 INFO L131 PetriNetUnfolder]: For 3152/20021 co-relation queries the response was YES. [2022-12-12 12:00:47,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17618 conditions, 5402 events. 1765/5402 cut-off events. For 3152/20021 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 54861 event pairs, 32 based on Foata normal form. 47/5404 useless extension candidates. Maximal degree in co-relation 17553. Up to 1294 conditions per place. [2022-12-12 12:00:47,250 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 38 selfloop transitions, 8 changer transitions 512/628 dead transitions. [2022-12-12 12:00:47,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 628 transitions, 6147 flow [2022-12-12 12:00:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 12:00:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 12:00:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1242 transitions. [2022-12-12 12:00:47,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8214285714285714 [2022-12-12 12:00:47,254 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 49 predicate places. [2022-12-12 12:00:47,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 628 transitions, 6147 flow [2022-12-12 12:00:47,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 628 transitions, 5525 flow, removed 310 selfloop flow, removed 1 redundant places. [2022-12-12 12:00:47,271 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 628 transitions, 5525 flow [2022-12-12 12:00:47,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:47,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:47,271 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] [2022-12-12 12:00:47,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 12:00:47,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1375282800, now seen corresponding path program 1 times [2022-12-12 12:00:47,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:47,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484845621] [2022-12-12 12:00:47,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:47,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:47,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484845621] [2022-12-12 12:00:47,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484845621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:47,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:47,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 12:00:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900299096] [2022-12-12 12:00:47,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 12:00:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 12:00:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-12 12:00:47,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-12-12 12:00:47,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 628 transitions, 5525 flow. Second operand has 12 states, 12 states have (on average 79.75) internal successors, (957), 12 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:47,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:47,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-12-12 12:00:47,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:51,247 INFO L130 PetriNetUnfolder]: 5571/14959 cut-off events. [2022-12-12 12:00:51,248 INFO L131 PetriNetUnfolder]: For 12472/79292 co-relation queries the response was YES. [2022-12-12 12:00:51,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50898 conditions, 14959 events. 5571/14959 cut-off events. For 12472/79292 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 167432 event pairs, 192 based on Foata normal form. 93/14979 useless extension candidates. Maximal degree in co-relation 50825. Up to 3375 conditions per place. [2022-12-12 12:00:51,422 INFO L137 encePairwiseOnDemand]: 93/108 looper letters, 46 selfloop transitions, 20 changer transitions 1863/1996 dead transitions. [2022-12-12 12:00:51,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1996 transitions, 22265 flow [2022-12-12 12:00:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-12 12:00:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-12 12:00:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2628 transitions. [2022-12-12 12:00:51,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7849462365591398 [2022-12-12 12:00:51,433 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 78 predicate places. [2022-12-12 12:00:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 1996 transitions, 22265 flow [2022-12-12 12:00:51,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 1996 transitions, 20933 flow, removed 665 selfloop flow, removed 1 redundant places. [2022-12-12 12:00:51,571 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 1996 transitions, 20933 flow [2022-12-12 12:00:51,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.75) internal successors, (957), 12 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:51,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:51,572 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] [2022-12-12 12:00:51,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 12:00:51,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -182036088, now seen corresponding path program 2 times [2022-12-12 12:00:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:51,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118214718] [2022-12-12 12:00:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118214718] [2022-12-12 12:00:51,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118214718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:51,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:51,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:00:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446615319] [2022-12-12 12:00:51,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:51,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:00:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:51,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:00:51,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:00:51,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-12 12:00:51,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 1996 transitions, 20933 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:51,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:51,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-12 12:00:51,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:54,928 INFO L130 PetriNetUnfolder]: 6126/16779 cut-off events. [2022-12-12 12:00:54,929 INFO L131 PetriNetUnfolder]: For 18629/130457 co-relation queries the response was YES. [2022-12-12 12:00:54,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62346 conditions, 16779 events. 6126/16779 cut-off events. For 18629/130457 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 192868 event pairs, 20 based on Foata normal form. 263/16975 useless extension candidates. Maximal degree in co-relation 62273. Up to 3079 conditions per place. [2022-12-12 12:00:54,990 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 47 selfloop transitions, 6 changer transitions 2526/2649 dead transitions. [2022-12-12 12:00:54,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 2649 transitions, 32983 flow [2022-12-12 12:00:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:00:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:00:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1159 transitions. [2022-12-12 12:00:54,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8254985754985755 [2022-12-12 12:00:54,993 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 89 predicate places. [2022-12-12 12:00:54,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 2649 transitions, 32983 flow [2022-12-12 12:00:55,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 2649 transitions, 31269 flow, removed 857 selfloop flow, removed 0 redundant places. [2022-12-12 12:00:55,051 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 2649 transitions, 31269 flow [2022-12-12 12:00:55,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:55,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:55,055 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] [2022-12-12 12:00:55,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 12:00:55,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1021028014, now seen corresponding path program 1 times [2022-12-12 12:00:55,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:55,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13468129] [2022-12-12 12:00:55,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:55,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13468129] [2022-12-12 12:00:55,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13468129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:55,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:55,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:00:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461100653] [2022-12-12 12:00:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:55,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:00:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:55,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:00:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:00:55,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-12 12:00:55,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 2649 transitions, 31269 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:55,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:55,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-12 12:00:55,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:00:58,815 INFO L130 PetriNetUnfolder]: 7337/16804 cut-off events. [2022-12-12 12:00:58,816 INFO L131 PetriNetUnfolder]: For 61538/67960 co-relation queries the response was YES. [2022-12-12 12:00:58,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60771 conditions, 16804 events. 7337/16804 cut-off events. For 61538/67960 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 168684 event pairs, 179 based on Foata normal form. 1022/17368 useless extension candidates. Maximal degree in co-relation 60698. Up to 4257 conditions per place. [2022-12-12 12:00:58,892 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 57 selfloop transitions, 7 changer transitions 1265/1434 dead transitions. [2022-12-12 12:00:58,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1434 transitions, 18099 flow [2022-12-12 12:00:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 12:00:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 12:00:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 931 transitions. [2022-12-12 12:00:58,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.862037037037037 [2022-12-12 12:00:58,895 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 83 predicate places. [2022-12-12 12:00:58,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1434 transitions, 18099 flow [2022-12-12 12:00:58,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1434 transitions, 17620 flow, removed 214 selfloop flow, removed 3 redundant places. [2022-12-12 12:00:58,925 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 1434 transitions, 17620 flow [2022-12-12 12:00:58,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:58,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:00:58,926 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] [2022-12-12 12:00:58,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 12:00:58,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:00:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:00:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1864112159, now seen corresponding path program 1 times [2022-12-12 12:00:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:00:58,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225344613] [2022-12-12 12:00:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:00:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:00:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:00:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:00:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:00:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225344613] [2022-12-12 12:00:59,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225344613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:00:59,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:00:59,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:00:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341651792] [2022-12-12 12:00:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:00:59,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:00:59,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:00:59,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:00:59,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:00:59,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-12 12:00:59,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1434 transitions, 17620 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:00:59,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:00:59,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-12 12:00:59,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:01,787 INFO L130 PetriNetUnfolder]: 5548/11921 cut-off events. [2022-12-12 12:01:01,787 INFO L131 PetriNetUnfolder]: For 60514/70297 co-relation queries the response was YES. [2022-12-12 12:01:01,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49375 conditions, 11921 events. 5548/11921 cut-off events. For 60514/70297 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 112822 event pairs, 101 based on Foata normal form. 1684/13417 useless extension candidates. Maximal degree in co-relation 49300. Up to 2646 conditions per place. [2022-12-12 12:01:01,853 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 55 selfloop transitions, 17 changer transitions 1278/1435 dead transitions. [2022-12-12 12:01:01,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1435 transitions, 20007 flow [2022-12-12 12:01:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:01:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:01:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1213 transitions. [2022-12-12 12:01:01,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.863960113960114 [2022-12-12 12:01:01,857 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 83 predicate places. [2022-12-12 12:01:01,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1435 transitions, 20007 flow [2022-12-12 12:01:01,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 1435 transitions, 18299 flow, removed 833 selfloop flow, removed 8 redundant places. [2022-12-12 12:01:01,910 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 1435 transitions, 18299 flow [2022-12-12 12:01:01,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:01:01,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:01,910 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] [2022-12-12 12:01:01,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 12:01:01,911 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1734050702, now seen corresponding path program 1 times [2022-12-12 12:01:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:01,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125304721] [2022-12-12 12:01:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:01:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:02,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125304721] [2022-12-12 12:01:02,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125304721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:02,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:02,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:01:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697110485] [2022-12-12 12:01:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:02,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:01:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:01:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:01:02,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-12 12:01:02,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1435 transitions, 18299 flow. Second operand has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:01:02,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:02,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-12 12:01:02,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:03,146 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][289], [24#L807true, 361#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0)), 229#true, 174#(= ~y~0 0), 155#true, 52#L3true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |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)), P0Thread1of1ForFork2InUse, 138#true, 13#L763true, 89#L784true, 293#true, 212#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2022-12-12 12:01:03,147 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,147 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,147 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,147 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-12 12:01:03,439 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][290], [229#true, 174#(= ~y~0 0), 52#L3true, 155#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |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)), P0Thread1of1ForFork2InUse, 138#true, 360#(= 0 ~x$r_buff0_thd1~0), 89#L784true, 293#true, 55#L814true, 212#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2022-12-12 12:01:03,440 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-12 12:01:03,440 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-12 12:01:03,441 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-12 12:01:03,441 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-12 12:01:03,447 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][371], [24#L807true, 172#true, 14#L794true, 229#true, 362#(and (= 0 ~x$r_buff0_thd1~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 155#true, 52#L3true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |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)), P0Thread1of1ForFork2InUse, 138#true, 206#(= ~__unbuffered_p2_EAX~0 0), 293#true]) [2022-12-12 12:01:03,447 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,447 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,447 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,447 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,452 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][437], [229#true, 349#(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)), 71#L4true, 155#true, 174#(= ~y~0 0), 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 360#(= 0 ~x$r_buff0_thd1~0), 293#true, 89#L784true, 55#L814true, 212#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2022-12-12 12:01:03,452 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,452 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,452 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,452 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,453 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][411], [24#L807true, 361#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0)), 229#true, 349#(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)), 71#L4true, 155#true, 174#(= ~y~0 0), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 13#L763true, 293#true, 89#L784true, 212#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2022-12-12 12:01:03,453 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,453 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,453 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,453 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-12 12:01:03,569 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][423], [24#L807true, 172#true, 14#L794true, 229#true, 362#(and (= 0 ~x$r_buff0_thd1~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 349#(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)), 71#L4true, 155#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 206#(= ~__unbuffered_p2_EAX~0 0), 293#true]) [2022-12-12 12:01:03,569 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,569 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,569 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,570 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,570 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][370], [24#L807true, 172#true, 361#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0)), 229#true, 155#true, 52#L3true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |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)), P0Thread1of1ForFork2InUse, 138#true, 13#L763true, 206#(= ~__unbuffered_p2_EAX~0 0), 93#L787true, 293#true]) [2022-12-12 12:01:03,570 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,571 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,571 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,571 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,571 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][432], [24#L807true, 172#true, 361#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0)), 229#true, 349#(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)), 71#L4true, 155#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 13#L763true, 206#(= ~__unbuffered_p2_EAX~0 0), 93#L787true, 293#true]) [2022-12-12 12:01:03,571 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,571 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,571 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,571 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,572 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][373], [172#true, 229#true, 155#true, 52#L3true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |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)), P0Thread1of1ForFork2InUse, 138#true, 206#(= ~__unbuffered_p2_EAX~0 0), 360#(= 0 ~x$r_buff0_thd1~0), 93#L787true, 293#true, 55#L814true]) [2022-12-12 12:01:03,572 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,572 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,572 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,572 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-12 12:01:03,572 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][440], [172#true, 229#true, 349#(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)), 71#L4true, 155#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 206#(= ~__unbuffered_p2_EAX~0 0), 360#(= 0 ~x$r_buff0_thd1~0), 93#L787true, 293#true, 55#L814true]) [2022-12-12 12:01:03,572 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,572 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,572 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,572 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,601 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][437], [229#true, 77#L4-1true, 349#(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)), 155#true, 174#(= ~y~0 0), 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 360#(= 0 ~x$r_buff0_thd1~0), 293#true, 89#L784true, 55#L814true, 212#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2022-12-12 12:01:03,601 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,601 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,601 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,601 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,601 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][411], [24#L807true, 361#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0)), 229#true, 77#L4-1true, 349#(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)), 155#true, 174#(= ~y~0 0), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 13#L763true, 293#true, 89#L784true, 212#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2022-12-12 12:01:03,605 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,605 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,605 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,605 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-12 12:01:03,752 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][423], [24#L807true, 172#true, 14#L794true, 229#true, 362#(and (= 0 ~x$r_buff0_thd1~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 77#L4-1true, 349#(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)), 155#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 206#(= ~__unbuffered_p2_EAX~0 0), 293#true]) [2022-12-12 12:01:03,752 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,752 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,752 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,752 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,753 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][432], [24#L807true, 361#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 77#L4-1true, 229#true, 349#(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)), 155#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 13#L763true, 206#(= ~__unbuffered_p2_EAX~0 0), 93#L787true, 293#true]) [2022-12-12 12:01:03,753 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,753 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,753 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,753 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,754 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][440], [172#true, 77#L4-1true, 229#true, 349#(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)), 155#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 206#(= ~__unbuffered_p2_EAX~0 0), 360#(= 0 ~x$r_buff0_thd1~0), 93#L787true, 293#true, 55#L814true]) [2022-12-12 12:01:03,754 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,754 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,754 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:03,754 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-12 12:01:05,086 INFO L130 PetriNetUnfolder]: 8045/18600 cut-off events. [2022-12-12 12:01:05,086 INFO L131 PetriNetUnfolder]: For 110090/123118 co-relation queries the response was YES. [2022-12-12 12:01:05,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71135 conditions, 18600 events. 8045/18600 cut-off events. For 110090/123118 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 199631 event pairs, 130 based on Foata normal form. 1386/19842 useless extension candidates. Maximal degree in co-relation 71053. Up to 3087 conditions per place. [2022-12-12 12:01:05,201 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 34 selfloop transitions, 19 changer transitions 1849/1992 dead transitions. [2022-12-12 12:01:05,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1992 transitions, 29805 flow [2022-12-12 12:01:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 12:01:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 12:01:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 875 transitions. [2022-12-12 12:01:05,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8101851851851852 [2022-12-12 12:01:05,203 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 84 predicate places. [2022-12-12 12:01:05,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 1992 transitions, 29805 flow [2022-12-12 12:01:05,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 1992 transitions, 29024 flow, removed 390 selfloop flow, removed 1 redundant places. [2022-12-12 12:01:05,274 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 1992 transitions, 29024 flow [2022-12-12 12:01:05,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:01:05,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:05,274 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] [2022-12-12 12:01:05,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 12:01:05,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash 985355094, now seen corresponding path program 2 times [2022-12-12 12:01:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:05,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133477859] [2022-12-12 12:01:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:01:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:05,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133477859] [2022-12-12 12:01:05,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133477859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:05,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:05,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 12:01:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244885145] [2022-12-12 12:01:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:05,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 12:01:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 12:01:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 12:01:05,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-12 12:01:05,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 1992 transitions, 29024 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:01:05,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:05,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-12 12:01:05,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:09,460 INFO L130 PetriNetUnfolder]: 7577/16739 cut-off events. [2022-12-12 12:01:09,460 INFO L131 PetriNetUnfolder]: For 87156/101498 co-relation queries the response was YES. [2022-12-12 12:01:09,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75558 conditions, 16739 events. 7577/16739 cut-off events. For 87156/101498 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 179740 event pairs, 137 based on Foata normal form. 2105/18715 useless extension candidates. Maximal degree in co-relation 75481. Up to 3081 conditions per place. [2022-12-12 12:01:09,537 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 49 selfloop transitions, 20 changer transitions 1620/1764 dead transitions. [2022-12-12 12:01:09,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 1764 transitions, 29452 flow [2022-12-12 12:01:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 12:01:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 12:01:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1459 transitions. [2022-12-12 12:01:09,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8443287037037037 [2022-12-12 12:01:09,555 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 71 predicate places. [2022-12-12 12:01:09,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 1764 transitions, 29452 flow [2022-12-12 12:01:09,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1764 transitions, 26465 flow, removed 1465 selfloop flow, removed 8 redundant places. [2022-12-12 12:01:09,606 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 1764 transitions, 26465 flow [2022-12-12 12:01:09,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:01:09,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:09,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:01:09,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 12:01:09,607 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash 162118531, now seen corresponding path program 1 times [2022-12-12 12:01:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126626789] [2022-12-12 12:01:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:01:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:01:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:01:10,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126626789] [2022-12-12 12:01:10,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126626789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:01:10,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:01:10,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-12 12:01:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427885430] [2022-12-12 12:01:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:01:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 12:01:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:01:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 12:01:10,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-12 12:01:10,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-12-12 12:01:10,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 1764 transitions, 26465 flow. Second operand has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:01:10,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:01:10,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-12-12 12:01:10,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:01:12,183 INFO L130 PetriNetUnfolder]: 7979/18079 cut-off events. [2022-12-12 12:01:12,183 INFO L131 PetriNetUnfolder]: For 111445/120878 co-relation queries the response was YES. [2022-12-12 12:01:12,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75768 conditions, 18079 events. 7979/18079 cut-off events. For 111445/120878 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 199714 event pairs, 143 based on Foata normal form. 999/18913 useless extension candidates. Maximal degree in co-relation 75683. Up to 3362 conditions per place. [2022-12-12 12:01:12,240 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 28 selfloop transitions, 9 changer transitions 1721/1838 dead transitions. [2022-12-12 12:01:12,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1838 transitions, 30833 flow [2022-12-12 12:01:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 12:01:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 12:01:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 919 transitions. [2022-12-12 12:01:12,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7735690235690236 [2022-12-12 12:01:12,242 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 73 predicate places. [2022-12-12 12:01:12,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1838 transitions, 30833 flow [2022-12-12 12:01:12,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1838 transitions, 29497 flow, removed 601 selfloop flow, removed 3 redundant places. [2022-12-12 12:01:12,279 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 1838 transitions, 29497 flow [2022-12-12 12:01:12,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.0909090909091) internal successors, (903), 11 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 12:01:12,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:01:12,279 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] [2022-12-12 12:01:12,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 12:01:12,280 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 12:01:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:01:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2010149005, now seen corresponding path program 2 times [2022-12-12 12:01:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:01:12,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787594282] [2022-12-12 12:01:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:01:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:01:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:01:12,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 12:01:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:01:12,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 12:01:12,367 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 12:01:12,368 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 12:01:12,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 12:01:12,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 12:01:12,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 12:01:12,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 12:01:12,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 12:01:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 12:01:12,374 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-12 12:01:12,378 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 12:01:12,378 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 12:01:12,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:01:12 BasicIcfg [2022-12-12 12:01:12,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 12:01:12,480 INFO L158 Benchmark]: Toolchain (without parser) took 31581.95ms. Allocated memory was 183.5MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 159.0MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-12 12:01:12,480 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 12:01:12,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.47ms. Allocated memory is still 183.5MB. Free memory was 158.5MB in the beginning and 132.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 12:01:12,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.01ms. Allocated memory is still 183.5MB. Free memory was 132.9MB in the beginning and 130.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:01:12,481 INFO L158 Benchmark]: Boogie Preprocessor took 45.97ms. Allocated memory is still 183.5MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:01:12,481 INFO L158 Benchmark]: RCFGBuilder took 564.00ms. Allocated memory is still 183.5MB. Free memory was 128.1MB in the beginning and 96.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-12 12:01:12,481 INFO L158 Benchmark]: TraceAbstraction took 30393.89ms. Allocated memory was 183.5MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 95.6MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-12 12:01:12,496 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.12ms. Allocated memory is still 183.5MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 516.47ms. Allocated memory is still 183.5MB. Free memory was 158.5MB in the beginning and 132.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.01ms. Allocated memory is still 183.5MB. Free memory was 132.9MB in the beginning and 130.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.97ms. Allocated memory is still 183.5MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.00ms. Allocated memory is still 183.5MB. Free memory was 128.1MB in the beginning and 96.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 30393.89ms. Allocated memory was 183.5MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 95.6MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2055; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=-2, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2056; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=-1, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2057; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1144 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1144 mSDsluCounter, 913 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 730 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2028 IncrementalHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 183 mSDtfsCounter, 2028 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31269occurred in iteration=8, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 11516 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1056 NumberOfCodeBlocks, 1056 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 959 ConstructedInterpolants, 0 QuantifiedInterpolants, 4256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 12:01:12,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...