/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:33:44,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:33:44,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:33:44,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:33:44,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:33:44,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:33:44,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:33:44,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:33:44,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:33:44,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:33:44,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:33:44,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:33:44,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:33:44,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:33:44,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:33:44,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:33:44,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:33:44,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:33:44,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:33:44,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:33:44,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:33:44,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:33:44,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:33:44,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:33:44,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:33:44,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:33:44,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:33:44,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:33:44,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:33:44,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:33:44,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:33:44,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:33:44,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:33:44,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:33:44,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:33:44,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:33:44,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:33:44,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:33:44,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:33:44,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:33:44,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:33:44,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:33:44,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:33:44,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:33:44,853 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:33:44,853 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:33:44,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:33:44,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:33:44,854 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:33:44,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:33:44,855 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:33:44,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:33:44,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:33:44,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:33:44,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:33:44,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:33:44,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:33:44,875 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:33:44,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:33:44,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:33:44,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:33:44,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:33:44,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:33:44,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:33:44,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:33:44,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:33:44,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:33:44,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:33:44,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:33:44,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:33:44,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:33:44,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:33:44,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:33:45,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:33:45,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:33:45,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:33:45,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:33:45,164 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:33:45,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-12 21:33:46,190 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:33:46,474 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:33:46,475 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-12 21:33:46,491 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c168ac5/7d4139de9b024086ab08a9373a1f3607/FLAGc88e72777 [2022-12-12 21:33:46,503 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c168ac5/7d4139de9b024086ab08a9373a1f3607 [2022-12-12 21:33:46,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:33:46,507 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:33:46,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:33:46,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:33:46,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:33:46,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:46,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b44716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46, skipping insertion in model container [2022-12-12 21:33:46,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:46,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:33:46,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:33:46,675 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/mix017_power.opt_rmo.opt.i[958,971] [2022-12-12 21:33:46,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:33:46,836 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:33:46,846 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/mix017_power.opt_rmo.opt.i[958,971] [2022-12-12 21:33:46,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:46,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:46,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:33:46,939 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:33:46,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46 WrapperNode [2022-12-12 21:33:46,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:33:46,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:33:46,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:33:46,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:33:46,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:46,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:46,985 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-12 21:33:46,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:33:46,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:33:46,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:33:46,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:33:46,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:46,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:33:47,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:33:47,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:33:47,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:33:47,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (1/1) ... [2022-12-12 21:33:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:33:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:33:47,063 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 21:33:47,065 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 21:33:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:33:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:33:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:33:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:33:47,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:33:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:33:47,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:33:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:33:47,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:33:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:33:47,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:33:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:33:47,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:33:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:33:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:33:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:33:47,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:33:47,092 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 21:33:47,205 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:33:47,207 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:33:47,566 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:33:47,710 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:33:47,711 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:33:47,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:33:47 BoogieIcfgContainer [2022-12-12 21:33:47,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:33:47,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:33:47,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:33:47,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:33:47,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:33:46" (1/3) ... [2022-12-12 21:33:47,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ea61ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:33:47, skipping insertion in model container [2022-12-12 21:33:47,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:46" (2/3) ... [2022-12-12 21:33:47,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ea61ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:33:47, skipping insertion in model container [2022-12-12 21:33:47,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:33:47" (3/3) ... [2022-12-12 21:33:47,720 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-12-12 21:33:47,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:33:47,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:33:47,734 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:33:47,786 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:33:47,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-12 21:33:47,878 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-12 21:33:47,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:33:47,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 21:33:47,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-12 21:33:47,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-12 21:33:47,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:33:47,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-12 21:33:47,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-12 21:33:47,926 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-12 21:33:47,926 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:33:47,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-12 21:33:47,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-12 21:33:47,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 2852 [2022-12-12 21:33:53,752 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-12 21:33:53,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:33:53,767 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;@348a8ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:33:53,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:33:53,771 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-12 21:33:53,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:33:53,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:53,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:53,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:33:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -710551530, now seen corresponding path program 1 times [2022-12-12 21:33:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25097556] [2022-12-12 21:33:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:54,160 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 21:33:54,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:54,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25097556] [2022-12-12 21:33:54,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25097556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:54,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:54,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:33:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540588864] [2022-12-12 21:33:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:54,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:33:54,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:33:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:33:54,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 71 [2022-12-12 21:33:54,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 21:33:54,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:54,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 71 [2022-12-12 21:33:54,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:58,931 INFO L130 PetriNetUnfolder]: 43504/62894 cut-off events. [2022-12-12 21:33:58,932 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-12 21:33:59,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120803 conditions, 62894 events. 43504/62894 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 3603. Compared 474314 event pairs, 11360 based on Foata normal form. 0/38728 useless extension candidates. Maximal degree in co-relation 120791. Up to 48285 conditions per place. [2022-12-12 21:33:59,159 INFO L137 encePairwiseOnDemand]: 66/71 looper letters, 40 selfloop transitions, 2 changer transitions 54/111 dead transitions. [2022-12-12 21:33:59,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 111 transitions, 429 flow [2022-12-12 21:33:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:33:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:33:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-12-12 21:33:59,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2022-12-12 21:33:59,176 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2022-12-12 21:33:59,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 111 transitions, 429 flow [2022-12-12 21:33:59,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 213 flow [2022-12-12 21:33:59,252 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 213 flow [2022-12-12 21:33:59,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 21:33:59,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:59,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:59,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:33:59,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:33:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1665542740, now seen corresponding path program 1 times [2022-12-12 21:33:59,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:59,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567789500] [2022-12-12 21:33:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:59,477 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 21:33:59,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567789500] [2022-12-12 21:33:59,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567789500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:59,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:59,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:33:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234892534] [2022-12-12 21:33:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:59,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:33:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:33:59,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:33:59,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 21:33:59,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:59,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:59,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 21:33:59,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:01,030 INFO L130 PetriNetUnfolder]: 16980/23587 cut-off events. [2022-12-12 21:34:01,030 INFO L131 PetriNetUnfolder]: For 4112/4112 co-relation queries the response was YES. [2022-12-12 21:34:01,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64533 conditions, 23587 events. 16980/23587 cut-off events. For 4112/4112 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 133240 event pairs, 2775 based on Foata normal form. 16/19686 useless extension candidates. Maximal degree in co-relation 64518. Up to 22336 conditions per place. [2022-12-12 21:34:01,125 INFO L137 encePairwiseOnDemand]: 65/71 looper letters, 64 selfloop transitions, 6 changer transitions 2/82 dead transitions. [2022-12-12 21:34:01,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 461 flow [2022-12-12 21:34:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:34:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:34:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-12 21:34:01,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37089201877934275 [2022-12-12 21:34:01,127 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -25 predicate places. [2022-12-12 21:34:01,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 82 transitions, 461 flow [2022-12-12 21:34:01,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 80 transitions, 453 flow [2022-12-12 21:34:01,211 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 80 transitions, 453 flow [2022-12-12 21:34:01,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:01,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:01,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:01,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:34:01,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash 525850217, now seen corresponding path program 1 times [2022-12-12 21:34:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:01,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107161981] [2022-12-12 21:34:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:01,344 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 21:34:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:01,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107161981] [2022-12-12 21:34:01,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107161981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:01,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:01,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:34:01,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855041927] [2022-12-12 21:34:01,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:01,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:34:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:34:01,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:34:01,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 21:34:01,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 80 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:01,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:01,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 21:34:01,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:02,613 INFO L130 PetriNetUnfolder]: 12559/17593 cut-off events. [2022-12-12 21:34:02,613 INFO L131 PetriNetUnfolder]: For 3001/3001 co-relation queries the response was YES. [2022-12-12 21:34:02,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65821 conditions, 17593 events. 12559/17593 cut-off events. For 3001/3001 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 93870 event pairs, 739 based on Foata normal form. 284/14875 useless extension candidates. Maximal degree in co-relation 65803. Up to 16629 conditions per place. [2022-12-12 21:34:02,736 INFO L137 encePairwiseOnDemand]: 68/71 looper letters, 91 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2022-12-12 21:34:02,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 104 transitions, 781 flow [2022-12-12 21:34:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:34:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:34:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-12 21:34:02,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3568075117370892 [2022-12-12 21:34:02,739 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -24 predicate places. [2022-12-12 21:34:02,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 104 transitions, 781 flow [2022-12-12 21:34:02,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 104 transitions, 781 flow [2022-12-12 21:34:02,833 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 104 transitions, 781 flow [2022-12-12 21:34:02,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:34:02,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:02,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:02,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:34:02,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1437862159, now seen corresponding path program 1 times [2022-12-12 21:34:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:02,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685744198] [2022-12-12 21:34:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:02,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 21:34:02,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:02,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685744198] [2022-12-12 21:34:02,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685744198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:02,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:02,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:34:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612345081] [2022-12-12 21:34:02,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:02,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:34:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:34:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:34:02,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 21:34:02,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 104 transitions, 781 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 21:34:02,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:02,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 21:34:02,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:05,501 INFO L130 PetriNetUnfolder]: 26619/36332 cut-off events. [2022-12-12 21:34:05,501 INFO L131 PetriNetUnfolder]: For 39822/40776 co-relation queries the response was YES. [2022-12-12 21:34:05,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159146 conditions, 36332 events. 26619/36332 cut-off events. For 39822/40776 co-relation queries the response was YES. Maximal size of possible extension queue 1393. Compared 207939 event pairs, 2912 based on Foata normal form. 2167/32480 useless extension candidates. Maximal degree in co-relation 159125. Up to 31351 conditions per place. [2022-12-12 21:34:05,732 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 112 selfloop transitions, 29 changer transitions 111/267 dead transitions. [2022-12-12 21:34:05,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 267 transitions, 2529 flow [2022-12-12 21:34:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:34:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:34:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-12-12 21:34:05,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4253521126760563 [2022-12-12 21:34:05,737 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -20 predicate places. [2022-12-12 21:34:05,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 267 transitions, 2529 flow [2022-12-12 21:34:05,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 156 transitions, 1467 flow [2022-12-12 21:34:05,888 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 156 transitions, 1467 flow [2022-12-12 21:34:05,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 21:34:05,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:05,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:05,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:34:05,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1704568889, now seen corresponding path program 1 times [2022-12-12 21:34:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:05,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508415637] [2022-12-12 21:34:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:06,017 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 21:34:06,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:06,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508415637] [2022-12-12 21:34:06,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508415637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:06,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:06,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:34:06,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842668221] [2022-12-12 21:34:06,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:06,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:34:06,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:06,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:34:06,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:34:06,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 21:34:06,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 156 transitions, 1467 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 21:34:06,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:06,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 21:34:06,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:08,256 INFO L130 PetriNetUnfolder]: 18695/26618 cut-off events. [2022-12-12 21:34:08,256 INFO L131 PetriNetUnfolder]: For 38379/40678 co-relation queries the response was YES. [2022-12-12 21:34:08,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140230 conditions, 26618 events. 18695/26618 cut-off events. For 38379/40678 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 160346 event pairs, 1341 based on Foata normal form. 2504/24969 useless extension candidates. Maximal degree in co-relation 140206. Up to 22998 conditions per place. [2022-12-12 21:34:08,416 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 131 selfloop transitions, 57 changer transitions 93/296 dead transitions. [2022-12-12 21:34:08,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 296 transitions, 3366 flow [2022-12-12 21:34:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:34:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:34:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2022-12-12 21:34:08,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43427230046948356 [2022-12-12 21:34:08,418 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -17 predicate places. [2022-12-12 21:34:08,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 296 transitions, 3366 flow [2022-12-12 21:34:08,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 203 transitions, 2298 flow [2022-12-12 21:34:08,531 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 203 transitions, 2298 flow [2022-12-12 21:34:08,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 21:34:08,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:08,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:08,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:34:08,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash -396631431, now seen corresponding path program 1 times [2022-12-12 21:34:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:08,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464202900] [2022-12-12 21:34:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:08,658 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 21:34:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:08,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464202900] [2022-12-12 21:34:08,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464202900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:08,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:08,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:34:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835271231] [2022-12-12 21:34:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:34:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:34:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:34:08,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 21:34:08,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 203 transitions, 2298 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 21:34:08,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:08,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 21:34:08,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:11,382 INFO L130 PetriNetUnfolder]: 22109/31761 cut-off events. [2022-12-12 21:34:11,382 INFO L131 PetriNetUnfolder]: For 55554/57752 co-relation queries the response was YES. [2022-12-12 21:34:11,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195560 conditions, 31761 events. 22109/31761 cut-off events. For 55554/57752 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 199940 event pairs, 1349 based on Foata normal form. 854/27302 useless extension candidates. Maximal degree in co-relation 195533. Up to 27749 conditions per place. [2022-12-12 21:34:11,566 INFO L137 encePairwiseOnDemand]: 64/71 looper letters, 326 selfloop transitions, 24 changer transitions 73/441 dead transitions. [2022-12-12 21:34:11,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 441 transitions, 5979 flow [2022-12-12 21:34:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:34:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:34:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-12 21:34:11,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3732394366197183 [2022-12-12 21:34:11,569 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -14 predicate places. [2022-12-12 21:34:11,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 441 transitions, 5979 flow [2022-12-12 21:34:11,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 368 transitions, 4957 flow [2022-12-12 21:34:11,697 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 368 transitions, 4957 flow [2022-12-12 21:34:11,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 21:34:11,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:11,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:11,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:34:11,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash 500970681, now seen corresponding path program 1 times [2022-12-12 21:34:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:11,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446118918] [2022-12-12 21:34:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:11,904 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 21:34:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:11,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446118918] [2022-12-12 21:34:11,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446118918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:11,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:11,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:34:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026060434] [2022-12-12 21:34:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:11,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:34:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:34:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:34:11,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 21:34:11,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 368 transitions, 4957 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 21:34:11,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:11,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 21:34:11,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:13,770 INFO L130 PetriNetUnfolder]: 11890/18830 cut-off events. [2022-12-12 21:34:13,770 INFO L131 PetriNetUnfolder]: For 49066/53125 co-relation queries the response was YES. [2022-12-12 21:34:13,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131373 conditions, 18830 events. 11890/18830 cut-off events. For 49066/53125 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 131640 event pairs, 351 based on Foata normal form. 2552/18328 useless extension candidates. Maximal degree in co-relation 131343. Up to 16073 conditions per place. [2022-12-12 21:34:13,882 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 224 selfloop transitions, 121 changer transitions 130/503 dead transitions. [2022-12-12 21:34:13,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 503 transitions, 7707 flow [2022-12-12 21:34:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:34:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:34:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2022-12-12 21:34:13,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43661971830985913 [2022-12-12 21:34:13,884 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -8 predicate places. [2022-12-12 21:34:13,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 503 transitions, 7707 flow [2022-12-12 21:34:14,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 373 transitions, 5688 flow [2022-12-12 21:34:14,072 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 373 transitions, 5688 flow [2022-12-12 21:34:14,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 21:34:14,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:14,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:14,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:34:14,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -776910707, now seen corresponding path program 1 times [2022-12-12 21:34:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:14,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144982812] [2022-12-12 21:34:14,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:14,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:14,254 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 21:34:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144982812] [2022-12-12 21:34:14,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144982812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:14,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:14,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:34:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726710668] [2022-12-12 21:34:14,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:14,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:34:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:34:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:34:14,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 21:34:14,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 373 transitions, 5688 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 21:34:14,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:14,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 21:34:14,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:16,253 INFO L130 PetriNetUnfolder]: 11786/18870 cut-off events. [2022-12-12 21:34:16,253 INFO L131 PetriNetUnfolder]: For 52771/55354 co-relation queries the response was YES. [2022-12-12 21:34:16,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147232 conditions, 18870 events. 11786/18870 cut-off events. For 52771/55354 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 133821 event pairs, 314 based on Foata normal form. 664/16453 useless extension candidates. Maximal degree in co-relation 147199. Up to 16224 conditions per place. [2022-12-12 21:34:16,365 INFO L137 encePairwiseOnDemand]: 63/71 looper letters, 528 selfloop transitions, 49 changer transitions 60/659 dead transitions. [2022-12-12 21:34:16,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 659 transitions, 11458 flow [2022-12-12 21:34:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:34:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:34:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2022-12-12 21:34:16,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3971830985915493 [2022-12-12 21:34:16,367 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -6 predicate places. [2022-12-12 21:34:16,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 659 transitions, 11458 flow [2022-12-12 21:34:16,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 599 transitions, 10399 flow [2022-12-12 21:34:16,456 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 599 transitions, 10399 flow [2022-12-12 21:34:16,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 21:34:16,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:16,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:16,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:34:16,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -982908435, now seen corresponding path program 1 times [2022-12-12 21:34:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:16,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260426268] [2022-12-12 21:34:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:16,619 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 21:34:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:16,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260426268] [2022-12-12 21:34:16,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260426268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:16,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:16,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:34:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087862246] [2022-12-12 21:34:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:16,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:34:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:16,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:34:16,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:34:16,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 21:34:16,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 599 transitions, 10399 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 21:34:16,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:16,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 21:34:16,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:19,574 INFO L130 PetriNetUnfolder]: 14066/23175 cut-off events. [2022-12-12 21:34:19,575 INFO L131 PetriNetUnfolder]: For 68244/71509 co-relation queries the response was YES. [2022-12-12 21:34:19,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198646 conditions, 23175 events. 14066/23175 cut-off events. For 68244/71509 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 178431 event pairs, 490 based on Foata normal form. 654/19945 useless extension candidates. Maximal degree in co-relation 198610. Up to 20371 conditions per place. [2022-12-12 21:34:19,682 INFO L137 encePairwiseOnDemand]: 63/71 looper letters, 466 selfloop transitions, 28 changer transitions 222/738 dead transitions. [2022-12-12 21:34:19,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 738 transitions, 14293 flow [2022-12-12 21:34:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:34:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:34:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2022-12-12 21:34:19,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36619718309859156 [2022-12-12 21:34:19,683 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -1 predicate places. [2022-12-12 21:34:19,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 738 transitions, 14293 flow [2022-12-12 21:34:19,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 516 transitions, 9884 flow [2022-12-12 21:34:19,764 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 516 transitions, 9884 flow [2022-12-12 21:34:19,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 21:34:19,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:19,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:19,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:34:19,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1066817151, now seen corresponding path program 2 times [2022-12-12 21:34:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:19,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553664072] [2022-12-12 21:34:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:19,950 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 21:34:19,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553664072] [2022-12-12 21:34:19,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553664072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:19,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:19,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:34:19,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493074903] [2022-12-12 21:34:19,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:19,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:34:19,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:19,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:34:19,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:34:19,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 71 [2022-12-12 21:34:19,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 516 transitions, 9884 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 21:34:19,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:19,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 71 [2022-12-12 21:34:19,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:21,406 INFO L130 PetriNetUnfolder]: 6484/10896 cut-off events. [2022-12-12 21:34:21,407 INFO L131 PetriNetUnfolder]: For 45701/48426 co-relation queries the response was YES. [2022-12-12 21:34:21,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103144 conditions, 10896 events. 6484/10896 cut-off events. For 45701/48426 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 75904 event pairs, 19 based on Foata normal form. 1244/10277 useless extension candidates. Maximal degree in co-relation 103105. Up to 9240 conditions per place. [2022-12-12 21:34:21,453 INFO L137 encePairwiseOnDemand]: 56/71 looper letters, 74 selfloop transitions, 105 changer transitions 343/534 dead transitions. [2022-12-12 21:34:21,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 534 transitions, 11188 flow [2022-12-12 21:34:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:34:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:34:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2022-12-12 21:34:21,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36795774647887325 [2022-12-12 21:34:21,455 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2022-12-12 21:34:21,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 534 transitions, 11188 flow [2022-12-12 21:34:21,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 191 transitions, 3871 flow [2022-12-12 21:34:21,485 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 191 transitions, 3871 flow [2022-12-12 21:34:21,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 21:34:21,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:21,485 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] [2022-12-12 21:34:21,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:34:21,486 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:21,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1036545289, now seen corresponding path program 1 times [2022-12-12 21:34:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:21,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618150711] [2022-12-12 21:34:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:21,665 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 21:34:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:21,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618150711] [2022-12-12 21:34:21,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618150711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:21,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:21,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:34:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491196158] [2022-12-12 21:34:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:21,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:34:21,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:21,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:34:21,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:34:21,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 21:34:21,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 191 transitions, 3871 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 21:34:21,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:21,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 21:34:21,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:22,462 INFO L130 PetriNetUnfolder]: 4387/7057 cut-off events. [2022-12-12 21:34:22,463 INFO L131 PetriNetUnfolder]: For 20246/20505 co-relation queries the response was YES. [2022-12-12 21:34:22,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72765 conditions, 7057 events. 4387/7057 cut-off events. For 20246/20505 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 43731 event pairs, 32 based on Foata normal form. 90/5578 useless extension candidates. Maximal degree in co-relation 72723. Up to 6596 conditions per place. [2022-12-12 21:34:22,495 INFO L137 encePairwiseOnDemand]: 66/71 looper letters, 113 selfloop transitions, 4 changer transitions 155/291 dead transitions. [2022-12-12 21:34:22,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 291 transitions, 6573 flow [2022-12-12 21:34:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:34:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:34:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-12 21:34:22,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28169014084507044 [2022-12-12 21:34:22,496 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2022-12-12 21:34:22,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 291 transitions, 6573 flow [2022-12-12 21:34:22,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 136 transitions, 2955 flow [2022-12-12 21:34:22,518 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 136 transitions, 2955 flow [2022-12-12 21:34:22,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 21:34:22,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:22,519 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] [2022-12-12 21:34:22,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:34:22,519 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1535611242, now seen corresponding path program 1 times [2022-12-12 21:34:22,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:22,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962071378] [2022-12-12 21:34:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:22,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:34:23,242 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 21:34:23,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:34:23,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962071378] [2022-12-12 21:34:23,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962071378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:34:23,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:34:23,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:34:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164894653] [2022-12-12 21:34:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:34:23,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:34:23,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:34:23,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:34:23,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:34:23,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 71 [2022-12-12 21:34:23,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 136 transitions, 2955 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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 21:34:23,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:34:23,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 71 [2022-12-12 21:34:23,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:34:23,999 INFO L130 PetriNetUnfolder]: 3627/6210 cut-off events. [2022-12-12 21:34:23,999 INFO L131 PetriNetUnfolder]: For 18790/18907 co-relation queries the response was YES. [2022-12-12 21:34:24,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68421 conditions, 6210 events. 3627/6210 cut-off events. For 18790/18907 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 41748 event pairs, 8 based on Foata normal form. 86/4771 useless extension candidates. Maximal degree in co-relation 68376. Up to 6067 conditions per place. [2022-12-12 21:34:24,033 INFO L137 encePairwiseOnDemand]: 64/71 looper letters, 151 selfloop transitions, 12 changer transitions 98/280 dead transitions. [2022-12-12 21:34:24,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 280 transitions, 6896 flow [2022-12-12 21:34:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:34:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:34:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2022-12-12 21:34:24,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2937625754527163 [2022-12-12 21:34:24,035 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2022-12-12 21:34:24,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 280 transitions, 6896 flow [2022-12-12 21:34:24,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 182 transitions, 4372 flow [2022-12-12 21:34:24,061 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 182 transitions, 4372 flow [2022-12-12 21:34:24,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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 21:34:24,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:34:24,061 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] [2022-12-12 21:34:24,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:34:24,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:34:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:34:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1474210903, now seen corresponding path program 2 times [2022-12-12 21:34:24,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:34:24,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800570423] [2022-12-12 21:34:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:34:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:34:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:34:24,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:34:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:34:24,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:34:24,145 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:34:24,146 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:34:24,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:34:24,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:34:24,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:34:24,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:34:24,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:34:24,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:34:24,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:34:24,149 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:34:24,157 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:34:24,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:34:24,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:34:24 BasicIcfg [2022-12-12 21:34:24,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:34:24,239 INFO L158 Benchmark]: Toolchain (without parser) took 37732.69ms. Allocated memory was 198.2MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 174.7MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-12 21:34:24,239 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 176.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:34:24,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.43ms. Allocated memory is still 198.2MB. Free memory was 174.5MB in the beginning and 147.0MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.56ms. Allocated memory is still 198.2MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,240 INFO L158 Benchmark]: Boogie Preprocessor took 45.77ms. Allocated memory is still 198.2MB. Free memory was 144.3MB in the beginning and 142.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,240 INFO L158 Benchmark]: RCFGBuilder took 680.44ms. Allocated memory is still 198.2MB. Free memory was 142.4MB in the beginning and 169.1MB in the end (delta: -26.7MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,240 INFO L158 Benchmark]: TraceAbstraction took 36524.71ms. Allocated memory was 198.2MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 167.6MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-12 21:34:24,241 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.10ms. Allocated memory is still 198.2MB. Free memory is still 176.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 433.43ms. Allocated memory is still 198.2MB. Free memory was 174.5MB in the beginning and 147.0MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.56ms. Allocated memory is still 198.2MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.77ms. Allocated memory is still 198.2MB. Free memory was 144.3MB in the beginning and 142.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 680.44ms. Allocated memory is still 198.2MB. Free memory was 142.4MB in the beginning and 169.1MB in the end (delta: -26.7MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. * TraceAbstraction took 36524.71ms. Allocated memory was 198.2MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 167.6MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 137 PlacesBefore, 83 PlacesAfterwards, 126 TransitionsBefore, 71 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 5589, independent unconditional: 0, dependent: 149, dependent conditional: 149, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5738, independent: 5589, independent conditional: 0, independent unconditional: 5589, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2731, independent: 2681, independent conditional: 0, independent unconditional: 2681, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2731, independent: 2635, independent conditional: 0, independent unconditional: 2635, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 201, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5738, independent: 2908, independent conditional: 0, independent unconditional: 2908, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 2731, unknown conditional: 0, unknown unconditional: 2731] , Statistics on independence cache: Total cache size (in pairs): 5388, Positive cache size: 5338, Positive conditional cache size: 0, Positive unconditional cache size: 5338, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-2, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-1, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=1, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 863]: 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: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 659 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 659 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1620 IncrementalHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 44 mSDtfsCounter, 1620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10399occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 24322 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:34:24,262 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...