/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:43:14,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:43:14,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:43:14,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:43:14,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:43:14,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:43:14,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:43:14,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:43:14,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:43:14,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:43:14,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:43:14,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:43:14,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:43:14,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:43:14,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:43:14,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:43:14,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:43:14,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:43:14,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:43:14,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:43:14,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:43:14,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:43:14,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:43:14,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:43:14,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:43:14,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:43:14,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:43:14,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:43:14,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:43:14,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:43:14,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:43:14,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:43:14,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:43:14,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:43:14,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:43:14,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:43:14,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:43:14,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:43:14,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:43:14,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:43:14,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:43:14,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 23:43:14,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:43:14,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:43:14,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:43:14,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:43:14,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:43:14,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:43:14,921 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:43:14,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:43:14,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:43:14,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:43:14,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:43:14,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:43:14,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:43:14,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:43:14,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:43:14,923 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:43:14,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:43:14,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:43:14,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:43:14,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:43:14,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:43:14,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:43:14,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:43:14,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:43:14,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:43:14,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:43:14,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:43:14,925 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:43:14,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:43:14,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:43:14,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:43:14,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:43:15,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:43:15,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:43:15,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:43:15,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:43:15,257 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:43:15,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 23:43:16,348 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:43:16,642 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:43:16,643 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 23:43:16,655 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d94aab94/5891305cea814b699e5d2e39434c7f59/FLAG2f95e2562 [2022-12-11 23:43:16,669 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d94aab94/5891305cea814b699e5d2e39434c7f59 [2022-12-11 23:43:16,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:43:16,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:43:16,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:43:16,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:43:16,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:43:16,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:43:16" (1/1) ... [2022-12-11 23:43:16,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16728047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:16, skipping insertion in model container [2022-12-11 23:43:16,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:43:16" (1/1) ... [2022-12-11 23:43:16,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:43:16,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:43:16,898 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-11 23:43:17,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:43:17,133 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:43:17,145 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-11 23:43:17,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:43:17,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:43:17,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:43:17,239 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:43:17,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17 WrapperNode [2022-12-11 23:43:17,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:43:17,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:43:17,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:43:17,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:43:17,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,307 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-11 23:43:17,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:43:17,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:43:17,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:43:17,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:43:17,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,354 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:43:17,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:43:17,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:43:17,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:43:17,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (1/1) ... [2022-12-11 23:43:17,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:43:17,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:43:17,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 23:43:17,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 23:43:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:43:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:43:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:43:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:43:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:43:17,452 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:43:17,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:43:17,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:43:17,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:43:17,452 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:43:17,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:43:17,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:43:17,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:43:17,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:43:17,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:43:17,454 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:43:17,615 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:43:17,632 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:43:17,924 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:43:18,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:43:18,051 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:43:18,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:43:18 BoogieIcfgContainer [2022-12-11 23:43:18,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:43:18,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:43:18,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:43:18,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:43:18,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:43:16" (1/3) ... [2022-12-11 23:43:18,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70341cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:43:18, skipping insertion in model container [2022-12-11 23:43:18,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:43:17" (2/3) ... [2022-12-11 23:43:18,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70341cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:43:18, skipping insertion in model container [2022-12-11 23:43:18,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:43:18" (3/3) ... [2022-12-11 23:43:18,060 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 23:43:18,076 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:43:18,078 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:43:18,078 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:43:18,130 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:43:18,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 23:43:18,222 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-11 23:43:18,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:43:18,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-11 23:43:18,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 23:43:18,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-11 23:43:18,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:43:18,251 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;@15de31e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:43:18,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 23:43:18,284 INFO L130 PetriNetUnfolder]: 0/68 cut-off events. [2022-12-11 23:43:18,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:43:18,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:18,286 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:18,286 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 522631231, now seen corresponding path program 1 times [2022-12-11 23:43:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:18,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047274627] [2022-12-11 23:43:18,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:18,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047274627] [2022-12-11 23:43:18,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047274627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:18,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:18,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:43:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152876962] [2022-12-11 23:43:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:18,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:43:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:43:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:43:18,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2022-12-11 23:43:18,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:18,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:18,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2022-12-11 23:43:18,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:18,993 INFO L130 PetriNetUnfolder]: 10/165 cut-off events. [2022-12-11 23:43:18,993 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 23:43:18,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 165 events. 10/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 328 event pairs, 4 based on Foata normal form. 5/161 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2022-12-11 23:43:18,997 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 8 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2022-12-11 23:43:18,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 101 transitions, 231 flow [2022-12-11 23:43:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:43:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:43:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-12-11 23:43:19,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9339622641509434 [2022-12-11 23:43:19,014 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-11 23:43:19,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 101 transitions, 231 flow [2022-12-11 23:43:19,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 101 transitions, 231 flow [2022-12-11 23:43:19,020 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 231 flow [2022-12-11 23:43:19,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:19,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:19,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:19,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:43:19,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -890217232, now seen corresponding path program 1 times [2022-12-11 23:43:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:19,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63878228] [2022-12-11 23:43:19,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:19,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:19,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63878228] [2022-12-11 23:43:19,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63878228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:19,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:19,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:43:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244415518] [2022-12-11 23:43:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:19,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:43:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:43:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:43:19,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 23:43:19,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:19,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:19,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 23:43:19,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:20,066 INFO L130 PetriNetUnfolder]: 673/2013 cut-off events. [2022-12-11 23:43:20,066 INFO L131 PetriNetUnfolder]: For 358/672 co-relation queries the response was YES. [2022-12-11 23:43:20,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 2013 events. 673/2013 cut-off events. For 358/672 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15770 event pairs, 113 based on Foata normal form. 3/1952 useless extension candidates. Maximal degree in co-relation 3529. Up to 496 conditions per place. [2022-12-11 23:43:20,088 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 30 selfloop transitions, 6 changer transitions 62/168 dead transitions. [2022-12-11 23:43:20,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 168 transitions, 613 flow [2022-12-11 23:43:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:43:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:43:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 819 transitions. [2022-12-11 23:43:20,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8584905660377359 [2022-12-11 23:43:20,096 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-12-11 23:43:20,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 168 transitions, 613 flow [2022-12-11 23:43:20,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 106 transitions, 335 flow [2022-12-11 23:43:20,104 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 106 transitions, 335 flow [2022-12-11 23:43:20,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:20,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:20,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:20,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:43:20,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash -358306929, now seen corresponding path program 1 times [2022-12-11 23:43:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977032333] [2022-12-11 23:43:20,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:20,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977032333] [2022-12-11 23:43:20,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977032333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:20,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:20,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:43:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872549296] [2022-12-11 23:43:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:20,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:43:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:20,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:43:20,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:43:20,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-11 23:43:20,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:20,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:20,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-11 23:43:20,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:20,883 INFO L130 PetriNetUnfolder]: 1566/3195 cut-off events. [2022-12-11 23:43:20,883 INFO L131 PetriNetUnfolder]: For 2413/2561 co-relation queries the response was YES. [2022-12-11 23:43:20,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7667 conditions, 3195 events. 1566/3195 cut-off events. For 2413/2561 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23239 event pairs, 97 based on Foata normal form. 75/3136 useless extension candidates. Maximal degree in co-relation 7608. Up to 1017 conditions per place. [2022-12-11 23:43:20,905 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 52 selfloop transitions, 9 changer transitions 44/183 dead transitions. [2022-12-11 23:43:20,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 183 transitions, 893 flow [2022-12-11 23:43:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:43:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:43:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 913 transitions. [2022-12-11 23:43:20,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8613207547169811 [2022-12-11 23:43:20,909 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2022-12-11 23:43:20,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 183 transitions, 893 flow [2022-12-11 23:43:20,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 139 transitions, 609 flow [2022-12-11 23:43:20,922 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 139 transitions, 609 flow [2022-12-11 23:43:20,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:20,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:20,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:20,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:43:20,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1315728558, now seen corresponding path program 1 times [2022-12-11 23:43:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:20,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874568659] [2022-12-11 23:43:20,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874568659] [2022-12-11 23:43:21,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874568659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:21,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:21,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:43:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780726604] [2022-12-11 23:43:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:21,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:43:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:43:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:43:21,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-11 23:43:21,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 139 transitions, 609 flow. Second operand has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:21,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:21,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-11 23:43:21,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:21,561 INFO L130 PetriNetUnfolder]: 633/1763 cut-off events. [2022-12-11 23:43:21,561 INFO L131 PetriNetUnfolder]: For 1497/1763 co-relation queries the response was YES. [2022-12-11 23:43:21,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 1763 events. 633/1763 cut-off events. For 1497/1763 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13739 event pairs, 35 based on Foata normal form. 126/1842 useless extension candidates. Maximal degree in co-relation 4996. Up to 661 conditions per place. [2022-12-11 23:43:21,571 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 74 selfloop transitions, 24 changer transitions 45/221 dead transitions. [2022-12-11 23:43:21,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 221 transitions, 1418 flow [2022-12-11 23:43:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:43:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:43:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1178 transitions. [2022-12-11 23:43:21,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8548621190130624 [2022-12-11 23:43:21,576 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-12-11 23:43:21,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 221 transitions, 1418 flow [2022-12-11 23:43:21,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 176 transitions, 1032 flow [2022-12-11 23:43:21,582 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 176 transitions, 1032 flow [2022-12-11 23:43:21,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:21,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:21,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:21,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:43:21,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -905577614, now seen corresponding path program 1 times [2022-12-11 23:43:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:21,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945922085] [2022-12-11 23:43:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:21,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945922085] [2022-12-11 23:43:21,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945922085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:21,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:21,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:43:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264380503] [2022-12-11 23:43:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:21,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:43:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:43:21,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:43:21,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-11 23:43:21,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 176 transitions, 1032 flow. Second operand has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:21,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:21,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-11 23:43:21,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:22,246 INFO L130 PetriNetUnfolder]: 453/1513 cut-off events. [2022-12-11 23:43:22,246 INFO L131 PetriNetUnfolder]: For 1427/1602 co-relation queries the response was YES. [2022-12-11 23:43:22,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 1513 events. 453/1513 cut-off events. For 1427/1602 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12537 event pairs, 36 based on Foata normal form. 95/1586 useless extension candidates. Maximal degree in co-relation 5175. Up to 488 conditions per place. [2022-12-11 23:43:22,255 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 61 selfloop transitions, 28 changer transitions 33/196 dead transitions. [2022-12-11 23:43:22,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 196 transitions, 1440 flow [2022-12-11 23:43:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:43:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:43:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1422 transitions. [2022-12-11 23:43:22,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8384433962264151 [2022-12-11 23:43:22,262 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 26 predicate places. [2022-12-11 23:43:22,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 196 transitions, 1440 flow [2022-12-11 23:43:22,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 163 transitions, 1097 flow [2022-12-11 23:43:22,273 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 163 transitions, 1097 flow [2022-12-11 23:43:22,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:22,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:22,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:22,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:43:22,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1953425484, now seen corresponding path program 1 times [2022-12-11 23:43:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:22,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781026329] [2022-12-11 23:43:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:22,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:22,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781026329] [2022-12-11 23:43:22,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781026329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:22,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:22,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:43:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360000170] [2022-12-11 23:43:22,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:22,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:43:22,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:22,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:43:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:43:22,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2022-12-11 23:43:22,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 163 transitions, 1097 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:22,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:22,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2022-12-11 23:43:22,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:22,793 INFO L130 PetriNetUnfolder]: 511/1809 cut-off events. [2022-12-11 23:43:22,793 INFO L131 PetriNetUnfolder]: For 2716/2953 co-relation queries the response was YES. [2022-12-11 23:43:22,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6557 conditions, 1809 events. 511/1809 cut-off events. For 2716/2953 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16595 event pairs, 38 based on Foata normal form. 95/1875 useless extension candidates. Maximal degree in co-relation 6486. Up to 577 conditions per place. [2022-12-11 23:43:22,824 INFO L137 encePairwiseOnDemand]: 100/106 looper letters, 50 selfloop transitions, 4 changer transitions 30/185 dead transitions. [2022-12-11 23:43:22,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 185 transitions, 1471 flow [2022-12-11 23:43:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 23:43:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 23:43:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-12-11 23:43:22,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8411949685534591 [2022-12-11 23:43:22,829 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 28 predicate places. [2022-12-11 23:43:22,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 185 transitions, 1471 flow [2022-12-11 23:43:22,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 155 transitions, 1127 flow [2022-12-11 23:43:22,834 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 155 transitions, 1127 flow [2022-12-11 23:43:22,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:22,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:22,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:22,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:43:22,835 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash -984472850, now seen corresponding path program 2 times [2022-12-11 23:43:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:22,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494545151] [2022-12-11 23:43:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:23,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:23,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494545151] [2022-12-11 23:43:23,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494545151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:23,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:23,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:43:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360952688] [2022-12-11 23:43:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:23,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:43:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:43:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:43:23,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 23:43:23,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 155 transitions, 1127 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:23,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:23,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 23:43:23,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:23,336 INFO L130 PetriNetUnfolder]: 305/1070 cut-off events. [2022-12-11 23:43:23,336 INFO L131 PetriNetUnfolder]: For 2624/2877 co-relation queries the response was YES. [2022-12-11 23:43:23,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4061 conditions, 1070 events. 305/1070 cut-off events. For 2624/2877 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8140 event pairs, 11 based on Foata normal form. 54/1117 useless extension candidates. Maximal degree in co-relation 3983. Up to 346 conditions per place. [2022-12-11 23:43:23,341 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 31 selfloop transitions, 9 changer transitions 68/187 dead transitions. [2022-12-11 23:43:23,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 187 transitions, 1690 flow [2022-12-11 23:43:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 23:43:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 23:43:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 681 transitions. [2022-12-11 23:43:23,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8030660377358491 [2022-12-11 23:43:23,344 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 26 predicate places. [2022-12-11 23:43:23,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 187 transitions, 1690 flow [2022-12-11 23:43:23,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 119 transitions, 780 flow [2022-12-11 23:43:23,347 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 119 transitions, 780 flow [2022-12-11 23:43:23,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:23,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:23,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:23,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:43:23,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:23,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1135044688, now seen corresponding path program 3 times [2022-12-11 23:43:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:23,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090737299] [2022-12-11 23:43:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:23,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:23,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-11 23:43:23,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:23,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090737299] [2022-12-11 23:43:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090737299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:23,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:23,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:43:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065830701] [2022-12-11 23:43:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:23,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:43:23,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:43:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:43:23,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 23:43:23,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 780 flow. Second operand has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:23,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:23,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 23:43:23,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:23,777 INFO L130 PetriNetUnfolder]: 123/611 cut-off events. [2022-12-11 23:43:23,777 INFO L131 PetriNetUnfolder]: For 1451/1489 co-relation queries the response was YES. [2022-12-11 23:43:23,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 611 events. 123/611 cut-off events. For 1451/1489 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4327 event pairs, 8 based on Foata normal form. 11/619 useless extension candidates. Maximal degree in co-relation 2209. Up to 168 conditions per place. [2022-12-11 23:43:23,780 INFO L137 encePairwiseOnDemand]: 98/106 looper letters, 25 selfloop transitions, 3 changer transitions 26/127 dead transitions. [2022-12-11 23:43:23,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 127 transitions, 972 flow [2022-12-11 23:43:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:43:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:43:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 758 transitions. [2022-12-11 23:43:23,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7945492662473794 [2022-12-11 23:43:23,783 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 26 predicate places. [2022-12-11 23:43:23,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 127 transitions, 972 flow [2022-12-11 23:43:23,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 101 transitions, 631 flow [2022-12-11 23:43:23,785 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 101 transitions, 631 flow [2022-12-11 23:43:23,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:23,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:23,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:23,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:43:23,786 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1494281264, now seen corresponding path program 4 times [2022-12-11 23:43:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:23,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968451770] [2022-12-11 23:43:23,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:23,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:43:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:43:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:43:24,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968451770] [2022-12-11 23:43:24,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968451770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:43:24,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:43:24,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:43:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072802440] [2022-12-11 23:43:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:43:24,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:43:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:43:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:43:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:43:24,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-11 23:43:24,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 101 transitions, 631 flow. Second operand has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:24,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:43:24,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-11 23:43:24,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:43:24,547 INFO L130 PetriNetUnfolder]: 30/212 cut-off events. [2022-12-11 23:43:24,547 INFO L131 PetriNetUnfolder]: For 729/733 co-relation queries the response was YES. [2022-12-11 23:43:24,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 212 events. 30/212 cut-off events. For 729/733 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 695 event pairs, 0 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 667. Up to 56 conditions per place. [2022-12-11 23:43:24,548 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 17 selfloop transitions, 6 changer transitions 11/108 dead transitions. [2022-12-11 23:43:24,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 108 transitions, 793 flow [2022-12-11 23:43:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:43:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:43:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 837 transitions. [2022-12-11 23:43:24,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.789622641509434 [2022-12-11 23:43:24,552 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 23 predicate places. [2022-12-11 23:43:24,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 108 transitions, 793 flow [2022-12-11 23:43:24,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 97 transitions, 605 flow [2022-12-11 23:43:24,554 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 605 flow [2022-12-11 23:43:24,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:43:24,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:43:24,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:43:24,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:43:24,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:43:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:43:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1546263702, now seen corresponding path program 5 times [2022-12-11 23:43:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:43:24,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611046941] [2022-12-11 23:43:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:43:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:43:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:43:24,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:43:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:43:24,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:43:24,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:43:24,682 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 23:43:24,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 23:43:24,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 23:43:24,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 23:43:24,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 23:43:24,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 23:43:24,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:43:24,690 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2022-12-11 23:43:24,695 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:43:24,696 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:43:24,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:43:24 BasicIcfg [2022-12-11 23:43:24,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:43:24,795 INFO L158 Benchmark]: Toolchain (without parser) took 8122.77ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 159.3MB in the beginning and 209.6MB in the end (delta: -50.3MB). Peak memory consumption was 59.3MB. Max. memory is 8.0GB. [2022-12-11 23:43:24,795 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:43:24,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.30ms. Allocated memory is still 184.5MB. Free memory was 159.3MB in the beginning and 133.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 23:43:24,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.05ms. Allocated memory is still 184.5MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:43:24,796 INFO L158 Benchmark]: Boogie Preprocessor took 48.74ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:43:24,796 INFO L158 Benchmark]: RCFGBuilder took 695.79ms. Allocated memory is still 184.5MB. Free memory was 128.9MB in the beginning and 98.5MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-11 23:43:24,796 INFO L158 Benchmark]: TraceAbstraction took 6738.60ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 97.5MB in the beginning and 209.6MB in the end (delta: -112.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:43:24,798 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.14ms. Allocated memory is still 184.5MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 567.30ms. Allocated memory is still 184.5MB. Free memory was 159.3MB in the beginning and 133.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.05ms. Allocated memory is still 184.5MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.74ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 128.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 695.79ms. Allocated memory is still 184.5MB. Free memory was 128.9MB in the beginning and 98.5MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6738.60ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 97.5MB in the beginning and 209.6MB in the end (delta: -112.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L827] 0 pthread_t t2577; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2577={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-2, t2577={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L829] 0 pthread_t t2578; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-1, t2577={5:0}, t2578={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L831] 0 pthread_t t2579; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=0, t2577={5:0}, t2578={6:0}, t2579={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 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) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 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) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=66, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 396 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 787 IncrementalHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 79 mSDtfsCounter, 787 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1127occurred in iteration=6, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 3074 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 665 ConstructedInterpolants, 0 QuantifiedInterpolants, 2365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 23:43:24,814 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...