/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:33:54,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:33:54,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:33:54,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:33:54,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:33:54,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:33:54,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:33:54,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:33:54,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:33:54,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:33:54,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:33:54,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:33:54,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:33:54,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:33:54,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:33:54,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:33:54,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:33:54,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:33:54,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:33:54,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:33:54,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:33:54,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:33:54,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:33:54,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:33:54,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:33:54,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:33:54,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:33:54,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:33:54,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:33:54,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:33:54,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:33:54,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:33:54,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:33:54,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:33:54,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:33:54,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:33:54,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:33:54,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:33:54,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:33:54,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:33:54,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:33:54,143 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 14:33:54,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:33:54,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:33:54,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:33:54,170 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:33:54,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:33:54,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:33:54,171 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:33:54,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:33:54,171 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:33:54,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:33:54,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:33:54,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:33:54,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:33:54,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:33:54,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:33:54,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:33:54,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:33:54,173 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:33:54,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:33:54,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:33:54,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:33:54,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:33:54,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:33:54,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:33:54,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:33:54,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:33:54,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:33:54,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:33:54,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:33:54,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:33:54,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 14:33:54,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:33:54,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:33:54,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:33:54,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:33:54,451 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:33:54,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-12 14:33:55,372 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:33:55,568 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:33:55,568 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-12 14:33:55,577 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a0bb698/64e0befec9d54d5ca3a61da139edce3f/FLAG8716243bb [2022-12-12 14:33:55,589 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a0bb698/64e0befec9d54d5ca3a61da139edce3f [2022-12-12 14:33:55,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:33:55,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:33:55,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:33:55,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:33:55,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:33:55,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:33:55" (1/1) ... [2022-12-12 14:33:55,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a61e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:55, skipping insertion in model container [2022-12-12 14:33:55,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:33:55" (1/1) ... [2022-12-12 14:33:55,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:33:55,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:33:55,720 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-12 14:33:55,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:33:55,869 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:33:55,880 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-12 14:33:55,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:33:55,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:33:55,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:33:56,010 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:33:56,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56 WrapperNode [2022-12-12 14:33:56,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:33:56,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:33:56,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:33:56,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:33:56,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,049 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-12 14:33:56,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:33:56,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:33:56,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:33:56,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:33:56,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,072 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:33:56,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:33:56,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:33:56,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:33:56,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (1/1) ... [2022-12-12 14:33:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:33:56,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:33:56,105 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 14:33:56,110 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 14:33:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:33:56,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:33:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:33:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:33:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:33:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:33:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:33:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:33:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:33:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:33:56,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:33:56,135 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 14:33:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 14:33:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:33:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:33:56,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:33:56,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:33:56,138 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 14:33:56,229 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:33:56,231 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:33:56,470 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:33:56,562 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:33:56,562 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:33:56,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:33:56 BoogieIcfgContainer [2022-12-12 14:33:56,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:33:56,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:33:56,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:33:56,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:33:56,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:33:55" (1/3) ... [2022-12-12 14:33:56,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9b5956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:33:56, skipping insertion in model container [2022-12-12 14:33:56,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:33:56" (2/3) ... [2022-12-12 14:33:56,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9b5956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:33:56, skipping insertion in model container [2022-12-12 14:33:56,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:33:56" (3/3) ... [2022-12-12 14:33:56,570 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2022-12-12 14:33:56,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:33:56,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:33:56,599 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:33:56,633 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:33:56,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-12 14:33:56,689 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-12 14:33:56,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:33:56,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-12 14:33:56,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-12 14:33:56,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-12 14:33:56,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:33:56,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-12 14:33:56,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-12 14:33:56,732 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-12 14:33:56,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:33:56,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-12 14:33:56,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-12 14:33:56,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-12 14:34:05,351 INFO L241 LiptonReduction]: Total number of compositions: 98 [2022-12-12 14:34:05,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:34:05,367 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;@de25b5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:34:05,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 14:34:05,370 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-12 14:34:05,371 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:34:05,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:05,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:34:05,372 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 14:34:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1718137257, now seen corresponding path program 1 times [2022-12-12 14:34:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:05,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088590015] [2022-12-12 14:34:05,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:05,805 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 14:34:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:05,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088590015] [2022-12-12 14:34:05,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088590015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:05,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:05,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:34:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672103686] [2022-12-12 14:34:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:05,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:34:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:34:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:34:05,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 72 [2022-12-12 14:34:05,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 156 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 14:34:05,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:05,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 72 [2022-12-12 14:34:05,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:11,425 INFO L130 PetriNetUnfolder]: 45079/65069 cut-off events. [2022-12-12 14:34:11,426 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-12 14:34:11,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125053 conditions, 65069 events. 45079/65069 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 3600. Compared 495417 event pairs, 11775 based on Foata normal form. 0/39954 useless extension candidates. Maximal degree in co-relation 125041. Up to 50025 conditions per place. [2022-12-12 14:34:11,648 INFO L137 encePairwiseOnDemand]: 67/72 looper letters, 40 selfloop transitions, 2 changer transitions 56/113 dead transitions. [2022-12-12 14:34:11,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 113 transitions, 437 flow [2022-12-12 14:34:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:34:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:34:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-12-12 14:34:11,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-12 14:34:11,658 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 156 flow. Second operand 3 states and 148 transitions. [2022-12-12 14:34:11,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 113 transitions, 437 flow [2022-12-12 14:34:11,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 113 transitions, 432 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-12 14:34:11,664 INFO L231 Difference]: Finished difference. Result has 80 places, 41 transitions, 94 flow [2022-12-12 14:34:11,666 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=80, PETRI_TRANSITIONS=41} [2022-12-12 14:34:11,668 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2022-12-12 14:34:11,668 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 41 transitions, 94 flow [2022-12-12 14:34:11,669 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 14:34:11,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:11,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:34:11,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:34:11,669 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 14:34:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1222412776, now seen corresponding path program 1 times [2022-12-12 14:34:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:11,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346670192] [2022-12-12 14:34:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:12,601 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 14:34:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:12,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346670192] [2022-12-12 14:34:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346670192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:12,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:12,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:34:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645836687] [2022-12-12 14:34:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:12,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:34:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:34:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:34:12,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 14:34:12,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 41 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:34:12,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:12,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 14:34:12,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:14,343 INFO L130 PetriNetUnfolder]: 18776/26106 cut-off events. [2022-12-12 14:34:14,343 INFO L131 PetriNetUnfolder]: For 855/855 co-relation queries the response was YES. [2022-12-12 14:34:14,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52493 conditions, 26106 events. 18776/26106 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 144496 event pairs, 3177 based on Foata normal form. 270/22335 useless extension candidates. Maximal degree in co-relation 52483. Up to 21494 conditions per place. [2022-12-12 14:34:14,519 INFO L137 encePairwiseOnDemand]: 61/72 looper letters, 55 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2022-12-12 14:34:14,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 306 flow [2022-12-12 14:34:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:34:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:34:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-12-12 14:34:14,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2022-12-12 14:34:14,523 INFO L175 Difference]: Start difference. First operand has 80 places, 41 transitions, 94 flow. Second operand 4 states and 109 transitions. [2022-12-12 14:34:14,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 306 flow [2022-12-12 14:34:14,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:34:14,529 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 167 flow [2022-12-12 14:34:14,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-12 14:34:14,529 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2022-12-12 14:34:14,529 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 167 flow [2022-12-12 14:34:14,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 14:34:14,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:14,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:34:14,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:34:14,530 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 14:34:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash -759910216, now seen corresponding path program 1 times [2022-12-12 14:34:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:14,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887537872] [2022-12-12 14:34:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:15,410 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 14:34:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:15,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887537872] [2022-12-12 14:34:15,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887537872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:15,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:15,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:34:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275661885] [2022-12-12 14:34:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:15,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:34:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:34:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:34:15,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 14:34:15,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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 14:34:15,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:15,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 14:34:15,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:16,905 INFO L130 PetriNetUnfolder]: 17667/24457 cut-off events. [2022-12-12 14:34:16,906 INFO L131 PetriNetUnfolder]: For 5767/5767 co-relation queries the response was YES. [2022-12-12 14:34:16,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61493 conditions, 24457 events. 17667/24457 cut-off events. For 5767/5767 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 132392 event pairs, 4631 based on Foata normal form. 300/20897 useless extension candidates. Maximal degree in co-relation 61481. Up to 15701 conditions per place. [2022-12-12 14:34:17,069 INFO L137 encePairwiseOnDemand]: 62/72 looper letters, 61 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2022-12-12 14:34:17,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 392 flow [2022-12-12 14:34:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:34:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:34:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-12 14:34:17,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-12 14:34:17,071 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 167 flow. Second operand 4 states and 104 transitions. [2022-12-12 14:34:17,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 392 flow [2022-12-12 14:34:17,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:34:17,077 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 244 flow [2022-12-12 14:34:17,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2022-12-12 14:34:17,078 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2022-12-12 14:34:17,078 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 244 flow [2022-12-12 14:34:17,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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 14:34:17,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:17,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:34:17,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:34:17,079 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 14:34:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2083535729, now seen corresponding path program 1 times [2022-12-12 14:34:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:17,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842445653] [2022-12-12 14:34:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:17,362 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 14:34:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:17,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842445653] [2022-12-12 14:34:17,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842445653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:17,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:17,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:34:17,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134972448] [2022-12-12 14:34:17,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:17,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:34:17,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:17,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:34:17,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:34:17,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 14:34:17,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 14:34:17,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:17,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 14:34:17,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:18,715 INFO L130 PetriNetUnfolder]: 13361/19692 cut-off events. [2022-12-12 14:34:18,715 INFO L131 PetriNetUnfolder]: For 14716/15326 co-relation queries the response was YES. [2022-12-12 14:34:18,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53797 conditions, 19692 events. 13361/19692 cut-off events. For 14716/15326 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 124331 event pairs, 3339 based on Foata normal form. 730/17131 useless extension candidates. Maximal degree in co-relation 53780. Up to 14404 conditions per place. [2022-12-12 14:34:18,889 INFO L137 encePairwiseOnDemand]: 69/72 looper letters, 50 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2022-12-12 14:34:18,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 391 flow [2022-12-12 14:34:18,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:34:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:34:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-12 14:34:18,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-12 14:34:18,892 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 244 flow. Second operand 3 states and 86 transitions. [2022-12-12 14:34:18,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 391 flow [2022-12-12 14:34:19,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 382 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 14:34:19,120 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 244 flow [2022-12-12 14:34:19,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2022-12-12 14:34:19,121 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places. [2022-12-12 14:34:19,121 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 244 flow [2022-12-12 14:34:19,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 14:34:19,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:19,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:34:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:34:19,122 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 14:34:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash -165127318, now seen corresponding path program 1 times [2022-12-12 14:34:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:19,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83752003] [2022-12-12 14:34:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:20,034 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 14:34:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83752003] [2022-12-12 14:34:20,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83752003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:20,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:20,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:34:20,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472161328] [2022-12-12 14:34:20,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:20,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:34:20,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:20,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:34:20,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:34:20,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 14:34:20,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 14:34:20,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:20,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 14:34:20,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:22,103 INFO L130 PetriNetUnfolder]: 20829/28861 cut-off events. [2022-12-12 14:34:22,104 INFO L131 PetriNetUnfolder]: For 17544/17544 co-relation queries the response was YES. [2022-12-12 14:34:22,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82471 conditions, 28861 events. 20829/28861 cut-off events. For 17544/17544 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 162471 event pairs, 3864 based on Foata normal form. 300/24545 useless extension candidates. Maximal degree in co-relation 82453. Up to 18722 conditions per place. [2022-12-12 14:34:22,329 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 90 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2022-12-12 14:34:22,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 675 flow [2022-12-12 14:34:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:34:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:34:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-12 14:34:22,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-12 14:34:22,331 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 244 flow. Second operand 4 states and 112 transitions. [2022-12-12 14:34:22,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 675 flow [2022-12-12 14:34:22,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:34:22,673 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 331 flow [2022-12-12 14:34:22,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2022-12-12 14:34:22,674 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2022-12-12 14:34:22,674 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 331 flow [2022-12-12 14:34:22,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 14:34:22,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:22,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:34:22,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:34:22,675 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 14:34:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1357351527, now seen corresponding path program 1 times [2022-12-12 14:34:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:22,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118093890] [2022-12-12 14:34:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:22,812 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 14:34:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:22,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118093890] [2022-12-12 14:34:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118093890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:22,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:34:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235183141] [2022-12-12 14:34:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:22,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:34:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:34:22,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:34:22,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 14:34:22,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 14:34:22,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:22,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 14:34:22,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:25,968 INFO L130 PetriNetUnfolder]: 30735/41968 cut-off events. [2022-12-12 14:34:25,969 INFO L131 PetriNetUnfolder]: For 63069/70636 co-relation queries the response was YES. [2022-12-12 14:34:26,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129230 conditions, 41968 events. 30735/41968 cut-off events. For 63069/70636 co-relation queries the response was YES. Maximal size of possible extension queue 2364. Compared 263653 event pairs, 8339 based on Foata normal form. 6195/33513 useless extension candidates. Maximal degree in co-relation 129211. Up to 31261 conditions per place. [2022-12-12 14:34:26,199 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 100 selfloop transitions, 23 changer transitions 29/169 dead transitions. [2022-12-12 14:34:26,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 169 transitions, 1207 flow [2022-12-12 14:34:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:34:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:34:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-12-12 14:34:26,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2022-12-12 14:34:26,201 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 331 flow. Second operand 5 states and 151 transitions. [2022-12-12 14:34:26,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 169 transitions, 1207 flow [2022-12-12 14:34:26,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 169 transitions, 1169 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:34:26,564 INFO L231 Difference]: Finished difference. Result has 69 places, 85 transitions, 505 flow [2022-12-12 14:34:26,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=505, PETRI_PLACES=69, PETRI_TRANSITIONS=85} [2022-12-12 14:34:26,565 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -15 predicate places. [2022-12-12 14:34:26,565 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 85 transitions, 505 flow [2022-12-12 14:34:26,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 14:34:26,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:26,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:34:26,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:34:26,566 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 14:34:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1261747147, now seen corresponding path program 1 times [2022-12-12 14:34:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220241686] [2022-12-12 14:34:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:26,711 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 14:34:26,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:26,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220241686] [2022-12-12 14:34:26,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220241686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:26,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:26,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:34:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057727389] [2022-12-12 14:34:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:26,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:34:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:34:26,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:34:26,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 14:34:26,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 85 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 14:34:26,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:26,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 14:34:26,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:29,698 INFO L130 PetriNetUnfolder]: 26880/38179 cut-off events. [2022-12-12 14:34:29,698 INFO L131 PetriNetUnfolder]: For 78321/91344 co-relation queries the response was YES. [2022-12-12 14:34:29,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155011 conditions, 38179 events. 26880/38179 cut-off events. For 78321/91344 co-relation queries the response was YES. Maximal size of possible extension queue 2376. Compared 259293 event pairs, 3002 based on Foata normal form. 6291/31055 useless extension candidates. Maximal degree in co-relation 154989. Up to 19012 conditions per place. [2022-12-12 14:34:29,954 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 164 selfloop transitions, 48 changer transitions 6/235 dead transitions. [2022-12-12 14:34:29,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 235 transitions, 1928 flow [2022-12-12 14:34:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:34:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:34:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2022-12-12 14:34:29,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2022-12-12 14:34:29,955 INFO L175 Difference]: Start difference. First operand has 69 places, 85 transitions, 505 flow. Second operand 7 states and 213 transitions. [2022-12-12 14:34:29,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 235 transitions, 1928 flow [2022-12-12 14:34:30,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 235 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:34:30,135 INFO L231 Difference]: Finished difference. Result has 77 places, 110 transitions, 857 flow [2022-12-12 14:34:30,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=857, PETRI_PLACES=77, PETRI_TRANSITIONS=110} [2022-12-12 14:34:30,136 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2022-12-12 14:34:30,136 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 110 transitions, 857 flow [2022-12-12 14:34:30,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 14:34:30,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:30,136 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] [2022-12-12 14:34:30,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:34:30,137 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 14:34:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1344966817, now seen corresponding path program 1 times [2022-12-12 14:34:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:30,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222123047] [2022-12-12 14:34:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:30,381 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 14:34:30,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:30,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222123047] [2022-12-12 14:34:30,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222123047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:30,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:30,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:34:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602282501] [2022-12-12 14:34:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:30,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:34:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:30,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:34:30,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:34:30,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 14:34:30,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 110 transitions, 857 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 14:34:30,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:30,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 14:34:30,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:33,125 INFO L130 PetriNetUnfolder]: 22185/32359 cut-off events. [2022-12-12 14:34:33,125 INFO L131 PetriNetUnfolder]: For 87233/103466 co-relation queries the response was YES. [2022-12-12 14:34:33,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162206 conditions, 32359 events. 22185/32359 cut-off events. For 87233/103466 co-relation queries the response was YES. Maximal size of possible extension queue 2017. Compared 227497 event pairs, 854 based on Foata normal form. 5268/25739 useless extension candidates. Maximal degree in co-relation 162180. Up to 17077 conditions per place. [2022-12-12 14:34:33,345 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 154 selfloop transitions, 73 changer transitions 37/281 dead transitions. [2022-12-12 14:34:33,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 281 transitions, 2627 flow [2022-12-12 14:34:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 14:34:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 14:34:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 276 transitions. [2022-12-12 14:34:33,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-12 14:34:33,347 INFO L175 Difference]: Start difference. First operand has 77 places, 110 transitions, 857 flow. Second operand 9 states and 276 transitions. [2022-12-12 14:34:33,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 281 transitions, 2627 flow [2022-12-12 14:34:35,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 281 transitions, 2492 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-12 14:34:35,110 INFO L231 Difference]: Finished difference. Result has 85 places, 134 transitions, 1195 flow [2022-12-12 14:34:35,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1195, PETRI_PLACES=85, PETRI_TRANSITIONS=134} [2022-12-12 14:34:35,111 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 1 predicate places. [2022-12-12 14:34:35,111 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 134 transitions, 1195 flow [2022-12-12 14:34:35,111 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 14:34:35,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:34:35,111 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] [2022-12-12 14:34:35,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:34:35,111 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 14:34:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:34:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1293033658, now seen corresponding path program 1 times [2022-12-12 14:34:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:34:35,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447543547] [2022-12-12 14:34:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:34:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:34:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:34:35,922 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 14:34:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:34:35,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447543547] [2022-12-12 14:34:35,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447543547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:34:35,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:34:35,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:34:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123559603] [2022-12-12 14:34:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:34:35,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:34:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:34:35,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:34:35,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:34:35,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 14:34:35,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 134 transitions, 1195 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 14:34:35,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:34:35,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 14:34:35,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:34:41,087 INFO L130 PetriNetUnfolder]: 40269/60576 cut-off events. [2022-12-12 14:34:41,087 INFO L131 PetriNetUnfolder]: For 248128/255449 co-relation queries the response was YES. [2022-12-12 14:34:41,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314181 conditions, 60576 events. 40269/60576 cut-off events. For 248128/255449 co-relation queries the response was YES. Maximal size of possible extension queue 3525. Compared 471463 event pairs, 5224 based on Foata normal form. 2095/52022 useless extension candidates. Maximal degree in co-relation 314152. Up to 26084 conditions per place. [2022-12-12 14:34:41,623 INFO L137 encePairwiseOnDemand]: 59/72 looper letters, 174 selfloop transitions, 44 changer transitions 127/367 dead transitions. [2022-12-12 14:34:41,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 367 transitions, 3891 flow [2022-12-12 14:34:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:34:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:34:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2022-12-12 14:34:41,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41203703703703703 [2022-12-12 14:34:41,625 INFO L175 Difference]: Start difference. First operand has 85 places, 134 transitions, 1195 flow. Second operand 6 states and 178 transitions. [2022-12-12 14:34:41,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 367 transitions, 3891 flow [2022-12-12 14:35:28,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 367 transitions, 3136 flow, removed 266 selfloop flow, removed 4 redundant places. [2022-12-12 14:35:28,226 INFO L231 Difference]: Finished difference. Result has 90 places, 130 transitions, 1120 flow [2022-12-12 14:35:28,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1120, PETRI_PLACES=90, PETRI_TRANSITIONS=130} [2022-12-12 14:35:28,227 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 6 predicate places. [2022-12-12 14:35:28,227 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 130 transitions, 1120 flow [2022-12-12 14:35:28,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 14:35:28,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:28,227 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] [2022-12-12 14:35:28,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:35:28,227 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 14:35:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2137770925, now seen corresponding path program 1 times [2022-12-12 14:35:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:28,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789268382] [2022-12-12 14:35:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:28,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:28,333 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 14:35:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789268382] [2022-12-12 14:35:28,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789268382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:28,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:28,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:35:28,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633528631] [2022-12-12 14:35:28,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:28,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:35:28,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:35:28,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:35:28,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 72 [2022-12-12 14:35:28,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 130 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 14:35:28,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:28,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 72 [2022-12-12 14:35:28,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:30,765 INFO L130 PetriNetUnfolder]: 18217/29285 cut-off events. [2022-12-12 14:35:30,765 INFO L131 PetriNetUnfolder]: For 118205/120221 co-relation queries the response was YES. [2022-12-12 14:35:30,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145678 conditions, 29285 events. 18217/29285 cut-off events. For 118205/120221 co-relation queries the response was YES. Maximal size of possible extension queue 1592. Compared 230799 event pairs, 3072 based on Foata normal form. 1308/24834 useless extension candidates. Maximal degree in co-relation 145644. Up to 12717 conditions per place. [2022-12-12 14:35:31,017 INFO L137 encePairwiseOnDemand]: 69/72 looper letters, 127 selfloop transitions, 10 changer transitions 7/176 dead transitions. [2022-12-12 14:35:31,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 176 transitions, 1730 flow [2022-12-12 14:35:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:35:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:35:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-12 14:35:31,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-12 14:35:31,018 INFO L175 Difference]: Start difference. First operand has 90 places, 130 transitions, 1120 flow. Second operand 3 states and 87 transitions. [2022-12-12 14:35:31,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 176 transitions, 1730 flow [2022-12-12 14:35:35,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 176 transitions, 1658 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-12-12 14:35:35,711 INFO L231 Difference]: Finished difference. Result has 82 places, 129 transitions, 1093 flow [2022-12-12 14:35:35,712 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=82, PETRI_TRANSITIONS=129} [2022-12-12 14:35:35,713 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2022-12-12 14:35:35,713 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 129 transitions, 1093 flow [2022-12-12 14:35:35,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 14:35:35,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:35,713 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] [2022-12-12 14:35:35,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:35:35,714 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 14:35:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -202036069, now seen corresponding path program 2 times [2022-12-12 14:35:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:35,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301096491] [2022-12-12 14:35:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:35,862 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 14:35:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301096491] [2022-12-12 14:35:35,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301096491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:35,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:35,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:35:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607892265] [2022-12-12 14:35:35,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:35,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:35:35,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:35,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:35:35,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:35:35,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 14:35:35,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 129 transitions, 1093 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 14:35:35,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:35,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 14:35:35,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:37,948 INFO L130 PetriNetUnfolder]: 15915/24663 cut-off events. [2022-12-12 14:35:37,948 INFO L131 PetriNetUnfolder]: For 58113/60175 co-relation queries the response was YES. [2022-12-12 14:35:38,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112102 conditions, 24663 events. 15915/24663 cut-off events. For 58113/60175 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 181735 event pairs, 316 based on Foata normal form. 2666/17456 useless extension candidates. Maximal degree in co-relation 112071. Up to 8875 conditions per place. [2022-12-12 14:35:38,064 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 59 selfloop transitions, 50 changer transitions 124/244 dead transitions. [2022-12-12 14:35:38,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 244 transitions, 2633 flow [2022-12-12 14:35:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:35:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:35:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2022-12-12 14:35:38,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3628472222222222 [2022-12-12 14:35:38,065 INFO L175 Difference]: Start difference. First operand has 82 places, 129 transitions, 1093 flow. Second operand 8 states and 209 transitions. [2022-12-12 14:35:38,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 244 transitions, 2633 flow [2022-12-12 14:35:39,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 244 transitions, 2548 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-12 14:35:39,275 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 659 flow [2022-12-12 14:35:39,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=659, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2022-12-12 14:35:39,276 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2022-12-12 14:35:39,276 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 659 flow [2022-12-12 14:35:39,276 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 14:35:39,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:39,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:39,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:35:39,276 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 14:35:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2053287883, now seen corresponding path program 1 times [2022-12-12 14:35:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:39,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907985159] [2022-12-12 14:35:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:39,441 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 14:35:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:39,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907985159] [2022-12-12 14:35:39,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907985159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:39,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:39,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:35:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180998450] [2022-12-12 14:35:39,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:39,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:35:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:35:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:35:39,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 14:35:39,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 659 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 14:35:39,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:39,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 14:35:39,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:40,308 INFO L130 PetriNetUnfolder]: 5631/9616 cut-off events. [2022-12-12 14:35:40,309 INFO L131 PetriNetUnfolder]: For 24470/25154 co-relation queries the response was YES. [2022-12-12 14:35:40,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45690 conditions, 9616 events. 5631/9616 cut-off events. For 24470/25154 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 70028 event pairs, 534 based on Foata normal form. 378/7885 useless extension candidates. Maximal degree in co-relation 45657. Up to 4148 conditions per place. [2022-12-12 14:35:40,351 INFO L137 encePairwiseOnDemand]: 69/72 looper letters, 77 selfloop transitions, 1 changer transitions 65/167 dead transitions. [2022-12-12 14:35:40,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 167 transitions, 1557 flow [2022-12-12 14:35:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-12 14:35:40,353 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-12 14:35:40,353 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 659 flow. Second operand 4 states and 120 transitions. [2022-12-12 14:35:40,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 167 transitions, 1557 flow [2022-12-12 14:35:40,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 167 transitions, 1208 flow, removed 79 selfloop flow, removed 13 redundant places. [2022-12-12 14:35:40,771 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 431 flow [2022-12-12 14:35:40,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2022-12-12 14:35:40,771 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2022-12-12 14:35:40,771 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 431 flow [2022-12-12 14:35:40,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 14:35:40,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:40,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:40,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:35:40,772 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 14:35:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash 503128921, now seen corresponding path program 2 times [2022-12-12 14:35:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:40,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585344268] [2022-12-12 14:35:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:41,602 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 14:35:41,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:41,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585344268] [2022-12-12 14:35:41,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585344268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:41,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:41,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:35:41,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735188578] [2022-12-12 14:35:41,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:41,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:35:41,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:35:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:35:41,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 14:35:41,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 431 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 14:35:41,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:41,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 14:35:41,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:42,392 INFO L130 PetriNetUnfolder]: 5573/8956 cut-off events. [2022-12-12 14:35:42,392 INFO L131 PetriNetUnfolder]: For 13227/13871 co-relation queries the response was YES. [2022-12-12 14:35:42,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32776 conditions, 8956 events. 5573/8956 cut-off events. For 13227/13871 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 57971 event pairs, 744 based on Foata normal form. 458/7209 useless extension candidates. Maximal degree in co-relation 32751. Up to 3953 conditions per place. [2022-12-12 14:35:42,418 INFO L137 encePairwiseOnDemand]: 63/72 looper letters, 84 selfloop transitions, 9 changer transitions 31/143 dead transitions. [2022-12-12 14:35:42,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 143 transitions, 1014 flow [2022-12-12 14:35:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:35:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:35:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-12-12 14:35:42,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2757936507936508 [2022-12-12 14:35:42,420 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 431 flow. Second operand 7 states and 139 transitions. [2022-12-12 14:35:42,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 143 transitions, 1014 flow [2022-12-12 14:35:42,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 143 transitions, 984 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-12 14:35:42,753 INFO L231 Difference]: Finished difference. Result has 76 places, 83 transitions, 477 flow [2022-12-12 14:35:42,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=76, PETRI_TRANSITIONS=83} [2022-12-12 14:35:42,754 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2022-12-12 14:35:42,754 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 477 flow [2022-12-12 14:35:42,755 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 14:35:42,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:42,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:42,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:35:42,755 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:35:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -490886297, now seen corresponding path program 3 times [2022-12-12 14:35:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:42,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279856872] [2022-12-12 14:35:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:42,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:43,417 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 14:35:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:43,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279856872] [2022-12-12 14:35:43,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279856872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:43,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:43,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:35:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216004379] [2022-12-12 14:35:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:43,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:35:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:35:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:35:43,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 14:35:43,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 83 transitions, 477 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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 14:35:43,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:43,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 14:35:43,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:44,038 INFO L130 PetriNetUnfolder]: 5696/9270 cut-off events. [2022-12-12 14:35:44,038 INFO L131 PetriNetUnfolder]: For 14072/14622 co-relation queries the response was YES. [2022-12-12 14:35:44,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34482 conditions, 9270 events. 5696/9270 cut-off events. For 14072/14622 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 62841 event pairs, 592 based on Foata normal form. 371/7120 useless extension candidates. Maximal degree in co-relation 34458. Up to 4341 conditions per place. [2022-12-12 14:35:44,075 INFO L137 encePairwiseOnDemand]: 67/72 looper letters, 73 selfloop transitions, 5 changer transitions 26/127 dead transitions. [2022-12-12 14:35:44,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 127 transitions, 918 flow [2022-12-12 14:35:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:35:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:35:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2022-12-12 14:35:44,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33055555555555555 [2022-12-12 14:35:44,077 INFO L175 Difference]: Start difference. First operand has 76 places, 83 transitions, 477 flow. Second operand 5 states and 119 transitions. [2022-12-12 14:35:44,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 127 transitions, 918 flow [2022-12-12 14:35:44,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 901 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-12 14:35:44,643 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 460 flow [2022-12-12 14:35:44,643 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=460, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2022-12-12 14:35:44,643 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2022-12-12 14:35:44,643 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 460 flow [2022-12-12 14:35:44,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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 14:35:44,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:44,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:44,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:35:44,644 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 14:35:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash 683359955, now seen corresponding path program 4 times [2022-12-12 14:35:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:44,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107151553] [2022-12-12 14:35:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:44,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:35:44,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:35:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:35:44,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:35:44,718 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:35:44,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 14:35:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 14:35:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 14:35:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 14:35:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 14:35:44,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 14:35:44,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 14:35:44,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:35:44,721 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:44,725 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:35:44,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:35:44,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:35:44 BasicIcfg [2022-12-12 14:35:44,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:35:44,802 INFO L158 Benchmark]: Toolchain (without parser) took 109209.96ms. Allocated memory was 178.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 153.5MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-12 14:35:44,802 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.0MB in the beginning and 105.0MB in the end (delta: 52.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:35:44,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.61ms. Allocated memory is still 178.3MB. Free memory was 153.3MB in the beginning and 154.4MB in the end (delta: -1.0MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. [2022-12-12 14:35:44,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.48ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:35:44,803 INFO L158 Benchmark]: Boogie Preprocessor took 25.58ms. Allocated memory is still 178.3MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:35:44,803 INFO L158 Benchmark]: RCFGBuilder took 488.23ms. Allocated memory is still 178.3MB. Free memory was 149.1MB in the beginning and 114.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 14:35:44,803 INFO L158 Benchmark]: TraceAbstraction took 108235.67ms. Allocated memory was 178.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 112.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-12 14:35:44,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.0MB in the beginning and 105.0MB in the end (delta: 52.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.61ms. Allocated memory is still 178.3MB. Free memory was 153.3MB in the beginning and 154.4MB in the end (delta: -1.0MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.48ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.58ms. Allocated memory is still 178.3MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 488.23ms. Allocated memory is still 178.3MB. Free memory was 149.1MB in the beginning and 114.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 108235.67ms. Allocated memory was 178.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 112.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 136 PlacesBefore, 84 PlacesAfterwards, 125 TransitionsBefore, 72 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 4499, independent unconditional: 0, dependent: 153, dependent conditional: 153, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 0, independent unconditional: 4499, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 0, independent unconditional: 4499, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 0, independent unconditional: 4499, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2663, independent: 2611, independent conditional: 0, independent unconditional: 2611, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2663, independent: 2558, independent conditional: 0, independent unconditional: 2558, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4652, independent: 1888, independent conditional: 0, independent unconditional: 1888, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 2663, unknown conditional: 0, unknown unconditional: 2663] , Statistics on independence cache: Total cache size (in pairs): 4539, Positive cache size: 4487, Positive conditional cache size: 0, Positive unconditional cache size: 4487, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t773, ((void *)0), P0, ((void *)0))=-3, t773={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] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t774, ((void *)0), P1, ((void *)0))=-2, t773={5:0}, t774={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] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t775, ((void *)0), P2, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={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] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t776, ((void *)0), P3, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 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) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 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_p3_EAX=2, __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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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_p3_EAX=2, __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, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 847]: 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: 851]: 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: 849]: 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: 853]: 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: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 108.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 92.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 742 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 742 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1784 IncrementalHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 42 mSDtfsCounter, 1784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1195occurred in iteration=8, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 14:35:44,829 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...