/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/mix033.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:52:57,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:52:57,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:52:57,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:52:57,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:52:57,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:52:57,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:52:57,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:52:57,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:52:57,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:52:57,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:52:57,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:52:57,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:52:57,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:52:57,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:52:57,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:52:57,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:52:57,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:52:57,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:52:57,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:52:57,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:52:57,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:52:57,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:52:57,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:52:57,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:52:57,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:52:57,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:52:57,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:52:57,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:52:57,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:52:57,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:52:57,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:52:57,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:52:57,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:52:57,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:52:57,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:52:57,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:52:57,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:52:57,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:52:57,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:52:57,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:52:57,757 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 11:52:57,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:52:57,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:52:57,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:52:57,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:52:57,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:52:57,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:52:57,792 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:52:57,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:52:57,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:52:57,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:52:57,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:52:57,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:52:57,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:52:57,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:52:57,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:52:57,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:52:57,796 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 11:52:58,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:52:58,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:52:58,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:52:58,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:52:58,071 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:52:58,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-12-12 11:52:59,084 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:52:59,258 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:52:59,258 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-12-12 11:52:59,269 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b04ffb8/ee6c7238b0954b8ca108e048a71f5619/FLAGdb72e7baf [2022-12-12 11:52:59,292 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73b04ffb8/ee6c7238b0954b8ca108e048a71f5619 [2022-12-12 11:52:59,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:52:59,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:52:59,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:52:59,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:52:59,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:52:59,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c2c9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59, skipping insertion in model container [2022-12-12 11:52:59,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:52:59,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:52:59,506 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i[944,957] [2022-12-12 11:52:59,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:52:59,727 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:52:59,736 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i[944,957] [2022-12-12 11:52:59,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:59,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:59,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:52:59,821 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:52:59,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59 WrapperNode [2022-12-12 11:52:59,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:52:59,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:52:59,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:52:59,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:52:59,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,882 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-12-12 11:52:59,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:52:59,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:52:59,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:52:59,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:52:59,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,899 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:52:59,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:52:59,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:52:59,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:52:59,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (1/1) ... [2022-12-12 11:52:59,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:52:59,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:52:59,946 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 11:52:59,962 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 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:52:59,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:52:59,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:52:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 11:52:59,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 11:52:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:52:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:52:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:52:59,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:52:59,975 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 11:53:00,093 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:53:00,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:53:00,330 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:53:00,398 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:53:00,398 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:53:00,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:53:00 BoogieIcfgContainer [2022-12-12 11:53:00,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:53:00,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:53:00,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:53:00,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:53:00,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:52:59" (1/3) ... [2022-12-12 11:53:00,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c00c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:53:00, skipping insertion in model container [2022-12-12 11:53:00,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:59" (2/3) ... [2022-12-12 11:53:00,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c00c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:53:00, skipping insertion in model container [2022-12-12 11:53:00,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:53:00" (3/3) ... [2022-12-12 11:53:00,410 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-12-12 11:53:00,425 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:53:00,425 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:53:00,425 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:53:00,475 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:53:00,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-12 11:53:00,585 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-12 11:53:00,585 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:53:00,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 11:53:00,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-12 11:53:00,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-12 11:53:00,607 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:53:00,613 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;@642c5aa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:53:00,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 11:53:00,636 INFO L130 PetriNetUnfolder]: 0/75 cut-off events. [2022-12-12 11:53:00,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:53:00,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:00,639 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] [2022-12-12 11:53:00,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1972684076, now seen corresponding path program 1 times [2022-12-12 11:53:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:00,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64668236] [2022-12-12 11:53:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:00,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:01,120 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 11:53:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:01,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64668236] [2022-12-12 11:53:01,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64668236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:01,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:01,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:53:01,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911380276] [2022-12-12 11:53:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:01,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:53:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:53:01,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:53:01,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 114 [2022-12-12 11:53:01,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 11:53:01,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:01,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 114 [2022-12-12 11:53:01,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:01,246 INFO L130 PetriNetUnfolder]: 10/149 cut-off events. [2022-12-12 11:53:01,246 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 11:53:01,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 149 events. 10/149 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 289 event pairs, 2 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 135. Up to 17 conditions per place. [2022-12-12 11:53:01,250 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 8 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-12-12 11:53:01,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 247 flow [2022-12-12 11:53:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:53:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:53:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-12-12 11:53:01,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-12-12 11:53:01,271 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 0 predicate places. [2022-12-12 11:53:01,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 247 flow [2022-12-12 11:53:01,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 240 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-12 11:53:01,276 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 240 flow [2022-12-12 11:53:01,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 11:53:01,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:01,276 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] [2022-12-12 11:53:01,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:53:01,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1810059170, now seen corresponding path program 1 times [2022-12-12 11:53:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:01,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009193509] [2022-12-12 11:53:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:01,616 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 11:53:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:01,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009193509] [2022-12-12 11:53:01,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009193509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:01,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:01,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:53:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955394030] [2022-12-12 11:53:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:01,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:53:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:01,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:53:01,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:53:01,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 114 [2022-12-12 11:53:01,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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 11:53:01,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:01,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 114 [2022-12-12 11:53:01,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:01,863 INFO L130 PetriNetUnfolder]: 84/387 cut-off events. [2022-12-12 11:53:01,863 INFO L131 PetriNetUnfolder]: For 76/102 co-relation queries the response was YES. [2022-12-12 11:53:01,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 387 events. 84/387 cut-off events. For 76/102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1913 event pairs, 14 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 606. Up to 80 conditions per place. [2022-12-12 11:53:01,870 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 17 selfloop transitions, 2 changer transitions 37/138 dead transitions. [2022-12-12 11:53:01,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 138 transitions, 426 flow [2022-12-12 11:53:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:53:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:53:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-12-12 11:53:01,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2022-12-12 11:53:01,875 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 5 predicate places. [2022-12-12 11:53:01,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 138 transitions, 426 flow [2022-12-12 11:53:01,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 138 transitions, 402 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:01,880 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 138 transitions, 402 flow [2022-12-12 11:53:01,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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 11:53:01,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:01,881 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 11:53:01,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:53:01,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:01,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1892820283, now seen corresponding path program 1 times [2022-12-12 11:53:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138233961] [2022-12-12 11:53:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:02,125 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 11:53:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:02,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138233961] [2022-12-12 11:53:02,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138233961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:02,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:02,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033441614] [2022-12-12 11:53:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:02,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:02,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-12-12 11:53:02,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 138 transitions, 402 flow. Second operand has 7 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 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 11:53:02,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:02,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-12-12 11:53:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:02,770 INFO L130 PetriNetUnfolder]: 1222/3429 cut-off events. [2022-12-12 11:53:02,771 INFO L131 PetriNetUnfolder]: For 730/1017 co-relation queries the response was YES. [2022-12-12 11:53:02,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6972 conditions, 3429 events. 1222/3429 cut-off events. For 730/1017 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 30315 event pairs, 78 based on Foata normal form. 2/3389 useless extension candidates. Maximal degree in co-relation 6913. Up to 569 conditions per place. [2022-12-12 11:53:02,785 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 43 selfloop transitions, 8 changer transitions 185/310 dead transitions. [2022-12-12 11:53:02,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 310 transitions, 1580 flow [2022-12-12 11:53:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:53:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:53:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1232 transitions. [2022-12-12 11:53:02,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8313090418353576 [2022-12-12 11:53:02,790 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-12-12 11:53:02,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 310 transitions, 1580 flow [2022-12-12 11:53:02,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 310 transitions, 1568 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:02,796 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 310 transitions, 1568 flow [2022-12-12 11:53:02,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 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 11:53:02,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:02,797 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] [2022-12-12 11:53:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:53:02,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 466522119, now seen corresponding path program 1 times [2022-12-12 11:53:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:02,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231875265] [2022-12-12 11:53:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:02,980 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 11:53:02,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:02,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231875265] [2022-12-12 11:53:02,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231875265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:02,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:02,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:53:02,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921118367] [2022-12-12 11:53:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:02,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:53:02,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:02,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:53:02,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:53:02,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-12 11:53:02,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 310 transitions, 1568 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:53:02,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:02,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-12 11:53:02,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:03,361 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([328] L773-->L789: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd2~0_38 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_71 256) 0) .cse9)) (.cse8 (and .cse9 .cse4)) (.cse12 (= (mod v_~z$w_buff0_used~0_82 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_70 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_81 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse5 v_~z~0_42 (ite .cse6 v_~z$w_buff0~0_40 v_~z$w_buff1~0_41)))) (and (= (ite .cse0 v_~z$r_buff1_thd2~0_38 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~z$r_buff1_thd2~0_38 0)) v_~z$r_buff1_thd2~0_37) (= (ite .cse0 v_~z$w_buff0_used~0_82 (ite .cse5 v_~z$w_buff0_used~0_82 (ite .cse6 0 v_~z$w_buff0_used~0_82))) v_~z$w_buff0_used~0_81) (= v_~weak$$choice2~0_30 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~z$w_buff1_used~0_71 (ite (or .cse1 .cse7 .cse8) v_~z$w_buff1_used~0_71 0)) v_~z$w_buff1_used~0_70) (= v_~z$w_buff1~0_41 v_~z$w_buff1~0_40) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse9) .cse8) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse1) .cse10) 0 v_~z$r_buff0_thd2~0_42)))) (= v_~z~0_40 (ite .cse0 v_~z$mem_tmp~0_14 .cse11)) (= v_~weak$$choice0~0_9 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z$flush_delayed~0_23 0) (= v_~z$mem_tmp~0_14 v_~z~0_42) (= v_~__unbuffered_p1_EBX~0_8 .cse11)))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_81, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$w_buff1~0=v_~z$w_buff1~0_40, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][167], [75#L755true, 116#L816true, P1Thread1of1ForFork0InUse, 79#L789true, 180#(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)), P2Thread1of1ForFork1InUse, 128#true, 56#L3true, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:03,362 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-12-12 11:53:03,362 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:03,362 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:03,362 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-12-12 11:53:03,375 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([328] L773-->L789: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd2~0_38 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_71 256) 0) .cse9)) (.cse8 (and .cse9 .cse4)) (.cse12 (= (mod v_~z$w_buff0_used~0_82 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_70 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_81 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse5 v_~z~0_42 (ite .cse6 v_~z$w_buff0~0_40 v_~z$w_buff1~0_41)))) (and (= (ite .cse0 v_~z$r_buff1_thd2~0_38 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~z$r_buff1_thd2~0_38 0)) v_~z$r_buff1_thd2~0_37) (= (ite .cse0 v_~z$w_buff0_used~0_82 (ite .cse5 v_~z$w_buff0_used~0_82 (ite .cse6 0 v_~z$w_buff0_used~0_82))) v_~z$w_buff0_used~0_81) (= v_~weak$$choice2~0_30 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~z$w_buff1_used~0_71 (ite (or .cse1 .cse7 .cse8) v_~z$w_buff1_used~0_71 0)) v_~z$w_buff1_used~0_70) (= v_~z$w_buff1~0_41 v_~z$w_buff1~0_40) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse9) .cse8) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse1) .cse10) 0 v_~z$r_buff0_thd2~0_42)))) (= v_~z~0_40 (ite .cse0 v_~z$mem_tmp~0_14 .cse11)) (= v_~weak$$choice0~0_9 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z$flush_delayed~0_23 0) (= v_~z$mem_tmp~0_14 v_~z~0_42) (= v_~__unbuffered_p1_EBX~0_8 .cse11)))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_81, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$w_buff1~0=v_~z$w_buff1~0_40, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][167], [75#L755true, 116#L816true, 113#L3-1true, P1Thread1of1ForFork0InUse, 79#L789true, 180#(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)), 128#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:03,375 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:03,375 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:03,375 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:03,375 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:03,394 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([328] L773-->L789: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd2~0_38 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_71 256) 0) .cse9)) (.cse8 (and .cse9 .cse4)) (.cse12 (= (mod v_~z$w_buff0_used~0_82 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_70 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_81 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse5 v_~z~0_42 (ite .cse6 v_~z$w_buff0~0_40 v_~z$w_buff1~0_41)))) (and (= (ite .cse0 v_~z$r_buff1_thd2~0_38 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~z$r_buff1_thd2~0_38 0)) v_~z$r_buff1_thd2~0_37) (= (ite .cse0 v_~z$w_buff0_used~0_82 (ite .cse5 v_~z$w_buff0_used~0_82 (ite .cse6 0 v_~z$w_buff0_used~0_82))) v_~z$w_buff0_used~0_81) (= v_~weak$$choice2~0_30 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~z$w_buff1_used~0_71 (ite (or .cse1 .cse7 .cse8) v_~z$w_buff1_used~0_71 0)) v_~z$w_buff1_used~0_70) (= v_~z$w_buff1~0_41 v_~z$w_buff1~0_40) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse9) .cse8) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse1) .cse10) 0 v_~z$r_buff0_thd2~0_42)))) (= v_~z~0_40 (ite .cse0 v_~z$mem_tmp~0_14 .cse11)) (= v_~weak$$choice0~0_9 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z$flush_delayed~0_23 0) (= v_~z$mem_tmp~0_14 v_~z~0_42) (= v_~__unbuffered_p1_EBX~0_8 .cse11)))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_81, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$w_buff1~0=v_~z$w_buff1~0_40, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][167], [75#L755true, 4#L819true, P1Thread1of1ForFork0InUse, 79#L789true, 180#(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)), 128#true, P2Thread1of1ForFork1InUse, 56#L3true, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:03,394 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,394 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,394 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,394 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,395 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L819-->L826: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_33 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_55))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse2) (and (not (= (mod v_~z$r_buff0_thd3~0_32 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94)) (= v_~z$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83)) (= v_~z$r_buff0_thd3~0_32 (ite .cse4 0 v_~z$r_buff0_thd3~0_33))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_33, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_55} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_32, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][181], [75#L755true, 33#L773true, 110#L826true, P1Thread1of1ForFork0InUse, 180#(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)), 128#true, P2Thread1of1ForFork1InUse, 56#L3true, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:03,395 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,395 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,395 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,395 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-12-12 11:53:03,411 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([328] L773-->L789: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd2~0_38 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_71 256) 0) .cse9)) (.cse8 (and .cse9 .cse4)) (.cse12 (= (mod v_~z$w_buff0_used~0_82 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_70 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_81 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse5 v_~z~0_42 (ite .cse6 v_~z$w_buff0~0_40 v_~z$w_buff1~0_41)))) (and (= (ite .cse0 v_~z$r_buff1_thd2~0_38 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~z$r_buff1_thd2~0_38 0)) v_~z$r_buff1_thd2~0_37) (= (ite .cse0 v_~z$w_buff0_used~0_82 (ite .cse5 v_~z$w_buff0_used~0_82 (ite .cse6 0 v_~z$w_buff0_used~0_82))) v_~z$w_buff0_used~0_81) (= v_~weak$$choice2~0_30 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~z$w_buff1_used~0_71 (ite (or .cse1 .cse7 .cse8) v_~z$w_buff1_used~0_71 0)) v_~z$w_buff1_used~0_70) (= v_~z$w_buff1~0_41 v_~z$w_buff1~0_40) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse9) .cse8) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse1) .cse10) 0 v_~z$r_buff0_thd2~0_42)))) (= v_~z~0_40 (ite .cse0 v_~z$mem_tmp~0_14 .cse11)) (= v_~weak$$choice0~0_9 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z$flush_delayed~0_23 0) (= v_~z$mem_tmp~0_14 v_~z~0_42) (= v_~__unbuffered_p1_EBX~0_8 .cse11)))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_81, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$w_buff1~0=v_~z$w_buff1~0_40, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][167], [75#L755true, 113#L3-1true, 4#L819true, P1Thread1of1ForFork0InUse, 79#L789true, 180#(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)), P2Thread1of1ForFork1InUse, 128#true, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:03,411 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,411 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,411 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,411 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,411 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L819-->L826: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_33 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_55))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse2) (and (not (= (mod v_~z$r_buff0_thd3~0_32 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94)) (= v_~z$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83)) (= v_~z$r_buff0_thd3~0_32 (ite .cse4 0 v_~z$r_buff0_thd3~0_33))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_33, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_55} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_32, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][181], [75#L755true, 113#L3-1true, 33#L773true, 110#L826true, P1Thread1of1ForFork0InUse, 180#(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)), P2Thread1of1ForFork1InUse, 128#true, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:03,411 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,412 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,412 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,412 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:03,720 INFO L130 PetriNetUnfolder]: 2641/6235 cut-off events. [2022-12-12 11:53:03,720 INFO L131 PetriNetUnfolder]: For 4828/5127 co-relation queries the response was YES. [2022-12-12 11:53:03,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15085 conditions, 6235 events. 2641/6235 cut-off events. For 4828/5127 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 54575 event pairs, 174 based on Foata normal form. 27/5916 useless extension candidates. Maximal degree in co-relation 15028. Up to 1524 conditions per place. [2022-12-12 11:53:03,761 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 106 selfloop transitions, 9 changer transitions 125/409 dead transitions. [2022-12-12 11:53:03,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 409 transitions, 2582 flow [2022-12-12 11:53:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:53:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:53:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2022-12-12 11:53:03,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8710526315789474 [2022-12-12 11:53:03,765 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places. [2022-12-12 11:53:03,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 409 transitions, 2582 flow [2022-12-12 11:53:03,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 409 transitions, 2578 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 11:53:03,772 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 409 transitions, 2578 flow [2022-12-12 11:53:03,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 11:53:03,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:03,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:03,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:53:03,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1170972556, now seen corresponding path program 1 times [2022-12-12 11:53:03,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:03,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540834178] [2022-12-12 11:53:03,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:03,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:03,959 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 11:53:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:03,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540834178] [2022-12-12 11:53:03,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540834178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:03,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:03,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664458572] [2022-12-12 11:53:03,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:03,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:03,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-12 11:53:03,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 409 transitions, 2578 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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 11:53:03,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:03,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-12 11:53:03,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:04,321 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([328] L773-->L789: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd2~0_38 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_71 256) 0) .cse9)) (.cse8 (and .cse9 .cse4)) (.cse12 (= (mod v_~z$w_buff0_used~0_82 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_70 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_81 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse5 v_~z~0_42 (ite .cse6 v_~z$w_buff0~0_40 v_~z$w_buff1~0_41)))) (and (= (ite .cse0 v_~z$r_buff1_thd2~0_38 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~z$r_buff1_thd2~0_38 0)) v_~z$r_buff1_thd2~0_37) (= (ite .cse0 v_~z$w_buff0_used~0_82 (ite .cse5 v_~z$w_buff0_used~0_82 (ite .cse6 0 v_~z$w_buff0_used~0_82))) v_~z$w_buff0_used~0_81) (= v_~weak$$choice2~0_30 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~z$w_buff1_used~0_71 (ite (or .cse1 .cse7 .cse8) v_~z$w_buff1_used~0_71 0)) v_~z$w_buff1_used~0_70) (= v_~z$w_buff1~0_41 v_~z$w_buff1~0_40) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse9) .cse8) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse1) .cse10) 0 v_~z$r_buff0_thd2~0_42)))) (= v_~z~0_40 (ite .cse0 v_~z$mem_tmp~0_14 .cse11)) (= v_~weak$$choice0~0_9 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z$flush_delayed~0_23 0) (= v_~z$mem_tmp~0_14 v_~z~0_42) (= v_~__unbuffered_p1_EBX~0_8 .cse11)))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_81, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$w_buff1~0=v_~z$w_buff1~0_40, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][149], [130#(= ~__unbuffered_p2_EAX~0 0), 75#L755true, 113#L3-1true, 25#L810true, P1Thread1of1ForFork0InUse, 199#(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)), 79#L789true, 180#(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)), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:04,321 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-12 11:53:04,321 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:04,321 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:04,321 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-12 11:53:04,394 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([328] L773-->L789: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd2~0_38 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_71 256) 0) .cse9)) (.cse8 (and .cse9 .cse4)) (.cse12 (= (mod v_~z$w_buff0_used~0_82 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_70 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_81 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse5 v_~z~0_42 (ite .cse6 v_~z$w_buff0~0_40 v_~z$w_buff1~0_41)))) (and (= (ite .cse0 v_~z$r_buff1_thd2~0_38 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~z$r_buff1_thd2~0_38 0)) v_~z$r_buff1_thd2~0_37) (= (ite .cse0 v_~z$w_buff0_used~0_82 (ite .cse5 v_~z$w_buff0_used~0_82 (ite .cse6 0 v_~z$w_buff0_used~0_82))) v_~z$w_buff0_used~0_81) (= v_~weak$$choice2~0_30 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~z$w_buff1_used~0_71 (ite (or .cse1 .cse7 .cse8) v_~z$w_buff1_used~0_71 0)) v_~z$w_buff1_used~0_70) (= v_~z$w_buff1~0_41 v_~z$w_buff1~0_40) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse9) .cse8) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse1) .cse10) 0 v_~z$r_buff0_thd2~0_42)))) (= v_~z~0_40 (ite .cse0 v_~z$mem_tmp~0_14 .cse11)) (= v_~weak$$choice0~0_9 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z$flush_delayed~0_23 0) (= v_~z$mem_tmp~0_14 v_~z~0_42) (= v_~__unbuffered_p1_EBX~0_8 .cse11)))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_81, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$w_buff1~0=v_~z$w_buff1~0_40, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][184], [75#L755true, 116#L816true, 113#L3-1true, P1Thread1of1ForFork0InUse, 199#(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)), 79#L789true, 180#(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)), P2Thread1of1ForFork1InUse, 128#true, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:04,395 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:04,395 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:04,395 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:04,395 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:04,427 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L819-->L826: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_33 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_55))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse2) (and (not (= (mod v_~z$r_buff0_thd3~0_32 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94)) (= v_~z$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83)) (= v_~z$r_buff0_thd3~0_32 (ite .cse4 0 v_~z$r_buff0_thd3~0_33))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_33, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_55} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_32, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][203], [75#L755true, 113#L3-1true, 33#L773true, 110#L826true, P1Thread1of1ForFork0InUse, 199#(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)), 180#(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)), P2Thread1of1ForFork1InUse, 128#true, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:04,428 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,428 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,428 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,428 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,428 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([328] L773-->L789: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd2~0_38 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd2~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_71 256) 0) .cse9)) (.cse8 (and .cse9 .cse4)) (.cse12 (= (mod v_~z$w_buff0_used~0_82 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~z$w_buff1_used~0_70 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_81 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse5 v_~z~0_42 (ite .cse6 v_~z$w_buff0~0_40 v_~z$w_buff1~0_41)))) (and (= (ite .cse0 v_~z$r_buff1_thd2~0_38 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd2~0_41 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~z$r_buff1_thd2~0_38 0)) v_~z$r_buff1_thd2~0_37) (= (ite .cse0 v_~z$w_buff0_used~0_82 (ite .cse5 v_~z$w_buff0_used~0_82 (ite .cse6 0 v_~z$w_buff0_used~0_82))) v_~z$w_buff0_used~0_81) (= v_~weak$$choice2~0_30 |v_P1Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~z$w_buff1_used~0_71 (ite (or .cse1 .cse7 .cse8) v_~z$w_buff1_used~0_71 0)) v_~z$w_buff1_used~0_70) (= v_~z$w_buff1~0_41 v_~z$w_buff1~0_40) (= v_~z$r_buff0_thd2~0_41 (ite .cse0 v_~z$r_buff0_thd2~0_42 (ite (or .cse1 (and .cse2 .cse9) .cse8) v_~z$r_buff0_thd2~0_42 (ite (and (not .cse1) .cse10) 0 v_~z$r_buff0_thd2~0_42)))) (= v_~z~0_40 (ite .cse0 v_~z$mem_tmp~0_14 .cse11)) (= v_~weak$$choice0~0_9 |v_P1Thread1of1ForFork0_#t~nondet3_1|) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z$flush_delayed~0_23 0) (= v_~z$mem_tmp~0_14 v_~z~0_42) (= v_~__unbuffered_p1_EBX~0_8 .cse11)))))) InVars {P1Thread1of1ForFork0_#t~nondet3=|v_P1Thread1of1ForFork0_#t~nondet3_1|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, P1Thread1of1ForFork0_#t~nondet4=|v_P1Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_42} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_81, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$w_buff1~0=v_~z$w_buff1~0_40, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet3, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd2~0][184], [75#L755true, 113#L3-1true, 4#L819true, 199#(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)), P1Thread1of1ForFork0InUse, 79#L789true, 180#(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)), 128#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 144#true, 125#true]) [2022-12-12 11:53:04,428 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,428 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,428 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,428 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:04,583 INFO L130 PetriNetUnfolder]: 1863/4160 cut-off events. [2022-12-12 11:53:04,584 INFO L131 PetriNetUnfolder]: For 5875/8191 co-relation queries the response was YES. [2022-12-12 11:53:04,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12876 conditions, 4160 events. 1863/4160 cut-off events. For 5875/8191 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33439 event pairs, 84 based on Foata normal form. 706/4640 useless extension candidates. Maximal degree in co-relation 12817. Up to 967 conditions per place. [2022-12-12 11:53:04,602 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 99 selfloop transitions, 28 changer transitions 227/452 dead transitions. [2022-12-12 11:53:04,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 452 transitions, 3454 flow [2022-12-12 11:53:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:53:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:53:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1293 transitions. [2022-12-12 11:53:04,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8724696356275303 [2022-12-12 11:53:04,608 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2022-12-12 11:53:04,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 452 transitions, 3454 flow [2022-12-12 11:53:04,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 452 transitions, 3224 flow, removed 107 selfloop flow, removed 4 redundant places. [2022-12-12 11:53:04,618 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 452 transitions, 3224 flow [2022-12-12 11:53:04,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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 11:53:04,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:04,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:04,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:53:04,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2575308, now seen corresponding path program 1 times [2022-12-12 11:53:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:04,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474492755] [2022-12-12 11:53:04,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:04,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:04,838 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 11:53:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:04,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474492755] [2022-12-12 11:53:04,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474492755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:04,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:04,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:53:04,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191334985] [2022-12-12 11:53:04,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:04,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:53:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:04,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:53:04,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:53:04,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-12 11:53:04,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 452 transitions, 3224 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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 11:53:04,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:04,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-12 11:53:04,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:05,434 INFO L130 PetriNetUnfolder]: 1612/3536 cut-off events. [2022-12-12 11:53:05,435 INFO L131 PetriNetUnfolder]: For 5019/6796 co-relation queries the response was YES. [2022-12-12 11:53:05,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12866 conditions, 3536 events. 1612/3536 cut-off events. For 5019/6796 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 28498 event pairs, 84 based on Foata normal form. 534/3920 useless extension candidates. Maximal degree in co-relation 12806. Up to 684 conditions per place. [2022-12-12 11:53:05,449 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 90 selfloop transitions, 36 changer transitions 198/408 dead transitions. [2022-12-12 11:53:05,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 408 transitions, 3552 flow [2022-12-12 11:53:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:53:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:53:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1562 transitions. [2022-12-12 11:53:05,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.856359649122807 [2022-12-12 11:53:05,452 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places. [2022-12-12 11:53:05,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 408 transitions, 3552 flow [2022-12-12 11:53:05,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 408 transitions, 3022 flow, removed 238 selfloop flow, removed 7 redundant places. [2022-12-12 11:53:05,461 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 408 transitions, 3022 flow [2022-12-12 11:53:05,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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 11:53:05,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:05,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:05,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:53:05,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1187933034, now seen corresponding path program 1 times [2022-12-12 11:53:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:05,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220911465] [2022-12-12 11:53:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:05,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:05,648 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 11:53:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:05,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220911465] [2022-12-12 11:53:05,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220911465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:05,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:05,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784564242] [2022-12-12 11:53:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:05,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:05,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-12-12 11:53:05,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 408 transitions, 3022 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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 11:53:05,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:05,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-12-12 11:53:05,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:06,190 INFO L130 PetriNetUnfolder]: 2184/4773 cut-off events. [2022-12-12 11:53:06,190 INFO L131 PetriNetUnfolder]: For 7452/9640 co-relation queries the response was YES. [2022-12-12 11:53:06,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16587 conditions, 4773 events. 2184/4773 cut-off events. For 7452/9640 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 41056 event pairs, 45 based on Foata normal form. 153/4786 useless extension candidates. Maximal degree in co-relation 16522. Up to 1044 conditions per place. [2022-12-12 11:53:06,219 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 77 selfloop transitions, 10 changer transitions 327/536 dead transitions. [2022-12-12 11:53:06,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 536 transitions, 4946 flow [2022-12-12 11:53:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:53:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:53:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2022-12-12 11:53:06,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8107769423558897 [2022-12-12 11:53:06,222 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 35 predicate places. [2022-12-12 11:53:06,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 536 transitions, 4946 flow [2022-12-12 11:53:06,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 536 transitions, 4744 flow, removed 101 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:06,236 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 536 transitions, 4744 flow [2022-12-12 11:53:06,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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 11:53:06,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:06,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:06,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:53:06,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash -897110386, now seen corresponding path program 2 times [2022-12-12 11:53:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:06,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943340606] [2022-12-12 11:53:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:06,474 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 11:53:06,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:06,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943340606] [2022-12-12 11:53:06,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943340606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:06,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:06,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:06,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564879040] [2022-12-12 11:53:06,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:06,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:06,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:06,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:06,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-12 11:53:06,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 536 transitions, 4744 flow. Second operand has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 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 11:53:06,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:06,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-12 11:53:06,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:07,421 INFO L130 PetriNetUnfolder]: 3850/8227 cut-off events. [2022-12-12 11:53:07,422 INFO L131 PetriNetUnfolder]: For 20647/24199 co-relation queries the response was YES. [2022-12-12 11:53:07,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30443 conditions, 8227 events. 3850/8227 cut-off events. For 20647/24199 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 76810 event pairs, 74 based on Foata normal form. 549/8516 useless extension candidates. Maximal degree in co-relation 30375. Up to 1876 conditions per place. [2022-12-12 11:53:07,451 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 25 selfloop transitions, 1 changer transitions 641/752 dead transitions. [2022-12-12 11:53:07,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 752 transitions, 8218 flow [2022-12-12 11:53:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 11:53:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 11:53:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 677 transitions. [2022-12-12 11:53:07,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8483709273182958 [2022-12-12 11:53:07,455 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places. [2022-12-12 11:53:07,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 752 transitions, 8218 flow [2022-12-12 11:53:07,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 752 transitions, 7914 flow, removed 152 selfloop flow, removed 0 redundant places. [2022-12-12 11:53:07,471 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 752 transitions, 7914 flow [2022-12-12 11:53:07,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 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 11:53:07,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:07,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:07,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:53:07,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 622175672, now seen corresponding path program 3 times [2022-12-12 11:53:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:07,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079974508] [2022-12-12 11:53:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:08,107 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 11:53:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:08,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079974508] [2022-12-12 11:53:08,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079974508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:08,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:08,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 11:53:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806931600] [2022-12-12 11:53:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:08,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 11:53:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 11:53:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-12 11:53:08,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 114 [2022-12-12 11:53:08,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 752 transitions, 7914 flow. Second operand has 10 states, 10 states have (on average 80.2) internal successors, (802), 10 states have internal predecessors, (802), 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 11:53:08,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:08,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 114 [2022-12-12 11:53:08,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:09,805 INFO L130 PetriNetUnfolder]: 5084/12355 cut-off events. [2022-12-12 11:53:09,806 INFO L131 PetriNetUnfolder]: For 29425/39862 co-relation queries the response was YES. [2022-12-12 11:53:09,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43124 conditions, 12355 events. 5084/12355 cut-off events. For 29425/39862 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 134091 event pairs, 89 based on Foata normal form. 1437/13588 useless extension candidates. Maximal degree in co-relation 43043. Up to 2269 conditions per place. [2022-12-12 11:53:09,850 INFO L137 encePairwiseOnDemand]: 94/114 looper letters, 20 selfloop transitions, 15 changer transitions 919/1024 dead transitions. [2022-12-12 11:53:09,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1024 transitions, 12644 flow [2022-12-12 11:53:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:53:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:53:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1078 transitions. [2022-12-12 11:53:09,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7273954116059379 [2022-12-12 11:53:09,853 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 53 predicate places. [2022-12-12 11:53:09,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1024 transitions, 12644 flow [2022-12-12 11:53:09,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 1024 transitions, 12206 flow, removed 150 selfloop flow, removed 2 redundant places. [2022-12-12 11:53:09,873 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 1024 transitions, 12206 flow [2022-12-12 11:53:09,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.2) internal successors, (802), 10 states have internal predecessors, (802), 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 11:53:09,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:09,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:09,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:53:09,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 11:53:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash -558665718, now seen corresponding path program 4 times [2022-12-12 11:53:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:09,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289310926] [2022-12-12 11:53:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:09,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:53:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:09,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:53:09,966 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:53:09,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 11:53:09,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 11:53:09,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 11:53:09,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 11:53:09,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 11:53:09,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 11:53:09,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 11:53:09,972 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:09,977 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:53:09,977 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:53:10,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:53:10 BasicIcfg [2022-12-12 11:53:10,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:53:10,081 INFO L158 Benchmark]: Toolchain (without parser) took 10784.14ms. Allocated memory was 177.2MB in the beginning and 983.6MB in the end (delta: 806.4MB). Free memory was 133.8MB in the beginning and 717.5MB in the end (delta: -583.7MB). Peak memory consumption was 223.7MB. Max. memory is 8.0GB. [2022-12-12 11:53:10,082 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:53:10,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.97ms. Allocated memory is still 177.2MB. Free memory was 133.8MB in the beginning and 107.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 11:53:10,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.91ms. Allocated memory is still 177.2MB. Free memory was 107.1MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 11:53:10,084 INFO L158 Benchmark]: Boogie Preprocessor took 19.02ms. Allocated memory is still 177.2MB. Free memory was 104.4MB in the beginning and 102.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 11:53:10,084 INFO L158 Benchmark]: RCFGBuilder took 497.15ms. Allocated memory is still 177.2MB. Free memory was 102.9MB in the beginning and 73.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 11:53:10,084 INFO L158 Benchmark]: TraceAbstraction took 9677.46ms. Allocated memory was 177.2MB in the beginning and 983.6MB in the end (delta: 806.4MB). Free memory was 71.9MB in the beginning and 717.5MB in the end (delta: -645.6MB). Peak memory consumption was 161.8MB. Max. memory is 8.0GB. [2022-12-12 11:53:10,086 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 177.2MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 525.97ms. Allocated memory is still 177.2MB. Free memory was 133.8MB in the beginning and 107.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.91ms. Allocated memory is still 177.2MB. Free memory was 107.1MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.02ms. Allocated memory is still 177.2MB. Free memory was 104.4MB in the beginning and 102.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 497.15ms. Allocated memory is still 177.2MB. Free memory was 102.9MB in the beginning and 73.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9677.46ms. Allocated memory was 177.2MB in the beginning and 983.6MB in the end (delta: 806.4MB). Free memory was 71.9MB in the beginning and 717.5MB in the end (delta: -645.6MB). Peak memory consumption was 161.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t876; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-2, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t877; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=-1, t876={5:0}, t877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t878; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t878, ((void *)0), P2, ((void *)0))=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 545 mSDsluCounter, 606 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 488 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 950 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 118 mSDtfsCounter, 950 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12206occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1751 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 2795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 11:53:10,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...