/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_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 21:04:16,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:04:16,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:04:16,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:04:16,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:04:16,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:04:16,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:04:16,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:04:16,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:04:16,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:04:17,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:04:17,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:04:17,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:04:17,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:04:17,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:04:17,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:04:17,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:04:17,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:04:17,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:04:17,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:04:17,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:04:17,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:04:17,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:04:17,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:04:17,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:04:17,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:04:17,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:04:17,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:04:17,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:04:17,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:04:17,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:04:17,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:04:17,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:04:17,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:04:17,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:04:17,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:04:17,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:04:17,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:04:17,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:04:17,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:04:17,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:04:17,039 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 21:04:17,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:04:17,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:04:17,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:04:17,076 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:04:17,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:04:17,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:04:17,078 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:04:17,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:04:17,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:04:17,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:04:17,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:04:17,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:04:17,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:04:17,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:04:17,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:04:17,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:04:17,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:17,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:04:17,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:04:17,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:04:17,081 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:04:17,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:04:17,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:04:17,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:04:17,081 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 [2022-12-11 21:04:17,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:04:17,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:04:17,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:04:17,381 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:04:17,381 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:04:17,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:18,397 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:04:18,545 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:04:18,546 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:18,554 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976c4d0e9/7c16fd8e7dee4a85a2a822b541428896/FLAGf13837caa [2022-12-11 21:04:18,566 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976c4d0e9/7c16fd8e7dee4a85a2a822b541428896 [2022-12-11 21:04:18,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:04:18,569 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:04:18,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:18,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:04:18,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:04:18,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:18" (1/1) ... [2022-12-11 21:04:18,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73bb4bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:18, skipping insertion in model container [2022-12-11 21:04:18,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:18" (1/1) ... [2022-12-11 21:04:18,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:04:18,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:04:18,761 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-11 21:04:18,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:18,946 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:04:18,956 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-11 21:04:18,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:18,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:18,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:19,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:19,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:19,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:19,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:19,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:19,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:19,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:19,033 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:04:19,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19 WrapperNode [2022-12-11 21:04:19,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:19,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:19,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:04:19,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:04:19,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,087 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-11 21:04:19,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:19,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:04:19,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:04:19,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:04:19,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,105 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:04:19,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:04:19,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:04:19,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:04:19,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (1/1) ... [2022-12-11 21:04:19,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:19,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:04:19,134 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 21:04:19,155 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 21:04:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:04:19,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:04:19,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:04:19,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:04:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:04:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:04:19,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:04:19,177 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 21:04:19,264 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:04:19,266 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:04:19,510 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:04:19,693 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:04:19,693 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:04:19,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:19 BoogieIcfgContainer [2022-12-11 21:04:19,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:04:19,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:04:19,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:04:19,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:04:19,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:04:18" (1/3) ... [2022-12-11 21:04:19,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a698982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:19, skipping insertion in model container [2022-12-11 21:04:19,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:19" (2/3) ... [2022-12-11 21:04:19,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a698982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:19, skipping insertion in model container [2022-12-11 21:04:19,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:19" (3/3) ... [2022-12-11 21:04:19,720 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-11 21:04:19,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:04:19,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:04:19,735 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:04:19,800 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:04:19,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-11 21:04:19,922 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-11 21:04:19,923 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:19,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-11 21:04:19,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-11 21:04:19,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-11 21:04:19,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:04:19,945 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;@722e9b3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:04:19,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 21:04:19,956 INFO L130 PetriNetUnfolder]: 0/57 cut-off events. [2022-12-11 21:04:19,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:19,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:19,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:19,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2130019754, now seen corresponding path program 1 times [2022-12-11 21:04:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:19,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624565736] [2022-12-11 21:04:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:20,405 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 21:04:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:20,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624565736] [2022-12-11 21:04:20,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624565736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:20,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:20,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:04:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706393257] [2022-12-11 21:04:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:20,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:04:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:04:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:04:20,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 108 [2022-12-11 21:04:20,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:20,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:20,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 108 [2022-12-11 21:04:20,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:20,572 INFO L130 PetriNetUnfolder]: 37/216 cut-off events. [2022-12-11 21:04:20,572 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-11 21:04:20,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 216 events. 37/216 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 711 event pairs, 7 based on Foata normal form. 13/214 useless extension candidates. Maximal degree in co-relation 259. Up to 51 conditions per place. [2022-12-11 21:04:20,577 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 11 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-11 21:04:20,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 105 transitions, 248 flow [2022-12-11 21:04:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:04:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:04:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-12-11 21:04:20,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-12-11 21:04:20,595 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 0 predicate places. [2022-12-11 21:04:20,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 248 flow [2022-12-11 21:04:20,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 248 flow [2022-12-11 21:04:20,600 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 105 transitions, 248 flow [2022-12-11 21:04:20,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:20,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:20,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:20,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:04:20,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash -950785167, now seen corresponding path program 1 times [2022-12-11 21:04:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:20,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365947251] [2022-12-11 21:04:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:20,911 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 21:04:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:20,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365947251] [2022-12-11 21:04:20,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365947251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:20,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:20,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973444109] [2022-12-11 21:04:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:20,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:20,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2022-12-11 21:04:20,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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 21:04:20,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:20,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2022-12-11 21:04:20,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:21,277 INFO L130 PetriNetUnfolder]: 330/989 cut-off events. [2022-12-11 21:04:21,278 INFO L131 PetriNetUnfolder]: For 321/478 co-relation queries the response was YES. [2022-12-11 21:04:21,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 989 events. 330/989 cut-off events. For 321/478 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6391 event pairs, 41 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1842. Up to 273 conditions per place. [2022-12-11 21:04:21,287 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 24 selfloop transitions, 2 changer transitions 52/153 dead transitions. [2022-12-11 21:04:21,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 153 transitions, 554 flow [2022-12-11 21:04:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:04:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:04:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 839 transitions. [2022-12-11 21:04:21,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8631687242798354 [2022-12-11 21:04:21,292 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 8 predicate places. [2022-12-11 21:04:21,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 153 transitions, 554 flow [2022-12-11 21:04:21,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 101 transitions, 304 flow [2022-12-11 21:04:21,297 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 101 transitions, 304 flow [2022-12-11 21:04:21,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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 21:04:21,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:21,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:21,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:04:21,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -303332750, now seen corresponding path program 1 times [2022-12-11 21:04:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:21,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748002961] [2022-12-11 21:04:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:21,528 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 21:04:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:21,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748002961] [2022-12-11 21:04:21,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748002961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:21,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:21,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352328211] [2022-12-11 21:04:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:21,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:21,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:21,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-11 21:04:21,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 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 21:04:21,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:21,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-11 21:04:21,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:21,788 INFO L130 PetriNetUnfolder]: 268/637 cut-off events. [2022-12-11 21:04:21,788 INFO L131 PetriNetUnfolder]: For 456/1794 co-relation queries the response was YES. [2022-12-11 21:04:21,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 637 events. 268/637 cut-off events. For 456/1794 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3399 event pairs, 23 based on Foata normal form. 22/635 useless extension candidates. Maximal degree in co-relation 1771. Up to 373 conditions per place. [2022-12-11 21:04:21,792 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 23 selfloop transitions, 4 changer transitions 47/147 dead transitions. [2022-12-11 21:04:21,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 147 transitions, 701 flow [2022-12-11 21:04:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:04:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:04:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 908 transitions. [2022-12-11 21:04:21,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2022-12-11 21:04:21,795 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 1 predicate places. [2022-12-11 21:04:21,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 147 transitions, 701 flow [2022-12-11 21:04:21,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 355 flow [2022-12-11 21:04:21,797 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 100 transitions, 355 flow [2022-12-11 21:04:21,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 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 21:04:21,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:21,798 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] [2022-12-11 21:04:21,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:04:21,798 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 861024329, now seen corresponding path program 1 times [2022-12-11 21:04:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:21,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974805518] [2022-12-11 21:04:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:22,028 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 21:04:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:22,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974805518] [2022-12-11 21:04:22,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974805518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:22,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:22,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136556089] [2022-12-11 21:04:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:22,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:22,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:22,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:22,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:22,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-11 21:04:22,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 100 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:22,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:22,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-11 21:04:22,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:22,319 INFO L130 PetriNetUnfolder]: 802/1600 cut-off events. [2022-12-11 21:04:22,319 INFO L131 PetriNetUnfolder]: For 2877/3052 co-relation queries the response was YES. [2022-12-11 21:04:22,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 1600 events. 802/1600 cut-off events. For 2877/3052 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9692 event pairs, 28 based on Foata normal form. 2/1547 useless extension candidates. Maximal degree in co-relation 4754. Up to 561 conditions per place. [2022-12-11 21:04:22,327 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 44 selfloop transitions, 7 changer transitions 57/180 dead transitions. [2022-12-11 21:04:22,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 180 transitions, 1043 flow [2022-12-11 21:04:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:04:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:04:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 931 transitions. [2022-12-11 21:04:22,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.862037037037037 [2022-12-11 21:04:22,331 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 4 predicate places. [2022-12-11 21:04:22,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 180 transitions, 1043 flow [2022-12-11 21:04:22,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 617 flow [2022-12-11 21:04:22,337 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 123 transitions, 617 flow [2022-12-11 21:04:22,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:22,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:22,337 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 21:04:22,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:04:22,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:22,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 954178912, now seen corresponding path program 1 times [2022-12-11 21:04:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:22,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494293552] [2022-12-11 21:04:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:22,528 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 21:04:22,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:22,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494293552] [2022-12-11 21:04:22,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494293552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:22,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:22,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549898148] [2022-12-11 21:04:22,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:22,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:22,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-11 21:04:22,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 123 transitions, 617 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:22,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:22,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-11 21:04:22,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:22,752 INFO L130 PetriNetUnfolder]: 265/740 cut-off events. [2022-12-11 21:04:22,752 INFO L131 PetriNetUnfolder]: For 1384/1780 co-relation queries the response was YES. [2022-12-11 21:04:22,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 740 events. 265/740 cut-off events. For 1384/1780 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4151 event pairs, 4 based on Foata normal form. 23/744 useless extension candidates. Maximal degree in co-relation 2404. Up to 346 conditions per place. [2022-12-11 21:04:22,756 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 49 selfloop transitions, 11 changer transitions 47/179 dead transitions. [2022-12-11 21:04:22,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 179 transitions, 1214 flow [2022-12-11 21:04:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:04:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:04:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1013 transitions. [2022-12-11 21:04:22,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8526936026936027 [2022-12-11 21:04:22,761 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 10 predicate places. [2022-12-11 21:04:22,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 179 transitions, 1214 flow [2022-12-11 21:04:22,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 132 transitions, 788 flow [2022-12-11 21:04:22,764 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 132 transitions, 788 flow [2022-12-11 21:04:22,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:22,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:22,765 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:22,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:04:22,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:22,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1790893409, now seen corresponding path program 1 times [2022-12-11 21:04:22,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:22,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236432094] [2022-12-11 21:04:22,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:22,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:23,004 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 21:04:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:23,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236432094] [2022-12-11 21:04:23,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236432094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:23,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:23,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:04:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274157729] [2022-12-11 21:04:23,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:23,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:04:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:04:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:04:23,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-11 21:04:23,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 132 transitions, 788 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:23,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:23,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-11 21:04:23,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:23,219 INFO L130 PetriNetUnfolder]: 95/419 cut-off events. [2022-12-11 21:04:23,219 INFO L131 PetriNetUnfolder]: For 946/1434 co-relation queries the response was YES. [2022-12-11 21:04:23,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 419 events. 95/419 cut-off events. For 946/1434 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2160 event pairs, 4 based on Foata normal form. 34/442 useless extension candidates. Maximal degree in co-relation 1496. Up to 134 conditions per place. [2022-12-11 21:04:23,222 INFO L137 encePairwiseOnDemand]: 99/108 looper letters, 39 selfloop transitions, 14 changer transitions 25/150 dead transitions. [2022-12-11 21:04:23,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 150 transitions, 1082 flow [2022-12-11 21:04:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1167 transitions. [2022-12-11 21:04:23,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8311965811965812 [2022-12-11 21:04:23,225 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 19 predicate places. [2022-12-11 21:04:23,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 150 transitions, 1082 flow [2022-12-11 21:04:23,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 828 flow [2022-12-11 21:04:23,227 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 828 flow [2022-12-11 21:04:23,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:23,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:23,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:23,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:04:23,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash 327136047, now seen corresponding path program 1 times [2022-12-11 21:04:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:23,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523730994] [2022-12-11 21:04:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:23,498 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 21:04:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:23,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523730994] [2022-12-11 21:04:23,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523730994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:23,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:23,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775148969] [2022-12-11 21:04:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:23,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:23,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:23,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-11 21:04:23,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 828 flow. Second operand has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 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 21:04:23,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:23,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-11 21:04:23,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:23,664 INFO L130 PetriNetUnfolder]: 133/585 cut-off events. [2022-12-11 21:04:23,664 INFO L131 PetriNetUnfolder]: For 2402/3109 co-relation queries the response was YES. [2022-12-11 21:04:23,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 585 events. 133/585 cut-off events. For 2402/3109 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3630 event pairs, 0 based on Foata normal form. 8/584 useless extension candidates. Maximal degree in co-relation 2349. Up to 137 conditions per place. [2022-12-11 21:04:23,666 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 31 selfloop transitions, 1 changer transitions 41/151 dead transitions. [2022-12-11 21:04:23,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 151 transitions, 1299 flow [2022-12-11 21:04:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:04:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:04:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 628 transitions. [2022-12-11 21:04:23,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8306878306878307 [2022-12-11 21:04:23,669 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 21 predicate places. [2022-12-11 21:04:23,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 151 transitions, 1299 flow [2022-12-11 21:04:23,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 110 transitions, 700 flow [2022-12-11 21:04:23,672 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 110 transitions, 700 flow [2022-12-11 21:04:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 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 21:04:23,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:23,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:23,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:04:23,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash 781003529, now seen corresponding path program 2 times [2022-12-11 21:04:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110063643] [2022-12-11 21:04:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:24,718 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 21:04:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:24,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110063643] [2022-12-11 21:04:24,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110063643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:24,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:24,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 21:04:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467931151] [2022-12-11 21:04:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:24,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 21:04:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 21:04:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-11 21:04:24,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2022-12-11 21:04:24,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 110 transitions, 700 flow. Second operand has 12 states, 12 states have (on average 77.33333333333333) internal successors, (928), 12 states have internal predecessors, (928), 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 21:04:24,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:24,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2022-12-11 21:04:24,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:24,950 INFO L130 PetriNetUnfolder]: 55/284 cut-off events. [2022-12-11 21:04:24,950 INFO L131 PetriNetUnfolder]: For 1178/1294 co-relation queries the response was YES. [2022-12-11 21:04:24,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 284 events. 55/284 cut-off events. For 1178/1294 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1095 event pairs, 0 based on Foata normal form. 8/292 useless extension candidates. Maximal degree in co-relation 990. Up to 81 conditions per place. [2022-12-11 21:04:24,951 INFO L137 encePairwiseOnDemand]: 95/108 looper letters, 28 selfloop transitions, 10 changer transitions 20/126 dead transitions. [2022-12-11 21:04:24,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 1021 flow [2022-12-11 21:04:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1016 transitions. [2022-12-11 21:04:24,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7236467236467237 [2022-12-11 21:04:24,955 INFO L295 CegarLoopForPetriNet]: 113 programPoint places, 23 predicate places. [2022-12-11 21:04:24,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 126 transitions, 1021 flow [2022-12-11 21:04:24,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 106 transitions, 709 flow [2022-12-11 21:04:24,956 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 106 transitions, 709 flow [2022-12-11 21:04:24,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.33333333333333) internal successors, (928), 12 states have internal predecessors, (928), 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 21:04:24,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:24,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:24,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:04:24,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:24,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1643746187, now seen corresponding path program 3 times [2022-12-11 21:04:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:24,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764725111] [2022-12-11 21:04:24,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:04:25,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:04:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:04:25,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:04:25,131 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:04:25,134 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 21:04:25,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 21:04:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 21:04:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 21:04:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 21:04:25,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 21:04:25,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 21:04:25,152 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:25,157 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:04:25,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:04:25,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:04:25 BasicIcfg [2022-12-11 21:04:25,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:04:25,256 INFO L158 Benchmark]: Toolchain (without parser) took 6687.22ms. Allocated memory was 173.0MB in the beginning and 333.4MB in the end (delta: 160.4MB). Free memory was 131.0MB in the beginning and 235.8MB in the end (delta: -104.8MB). Peak memory consumption was 55.7MB. Max. memory is 8.0GB. [2022-12-11 21:04:25,256 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:04:25,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.34ms. Allocated memory is still 173.0MB. Free memory was 131.0MB in the beginning and 104.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 21:04:25,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.27ms. Allocated memory is still 173.0MB. Free memory was 104.8MB in the beginning and 102.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 21:04:25,257 INFO L158 Benchmark]: Boogie Preprocessor took 20.46ms. Allocated memory is still 173.0MB. Free memory was 102.2MB in the beginning and 100.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 21:04:25,257 INFO L158 Benchmark]: RCFGBuilder took 586.00ms. Allocated memory is still 173.0MB. Free memory was 100.1MB in the beginning and 68.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-11 21:04:25,257 INFO L158 Benchmark]: TraceAbstraction took 5559.07ms. Allocated memory was 173.0MB in the beginning and 333.4MB in the end (delta: 160.4MB). Free memory was 67.6MB in the beginning and 235.8MB in the end (delta: -168.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:04:25,258 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.09ms. Allocated memory is still 173.0MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.34ms. Allocated memory is still 173.0MB. Free memory was 131.0MB in the beginning and 104.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.27ms. Allocated memory is still 173.0MB. Free memory was 104.8MB in the beginning and 102.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.46ms. Allocated memory is still 173.0MB. Free memory was 102.2MB in the beginning and 100.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 586.00ms. Allocated memory is still 173.0MB. Free memory was 100.1MB in the beginning and 68.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5559.07ms. Allocated memory was 173.0MB in the beginning and 333.4MB in the end (delta: 160.4MB). Free memory was 67.6MB in the beginning and 235.8MB in the end (delta: -168.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2345; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-2, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2346; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=-1, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2347; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 56 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=828occurred in iteration=6, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 2613 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 2146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 21:04:25,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...