/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:29:58,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:29:58,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:29:58,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:29:58,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:29:58,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:29:58,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:29:58,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:29:58,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:29:58,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:29:58,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:29:58,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:29:58,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:29:58,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:29:58,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:29:58,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:29:58,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:29:58,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:29:58,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:29:58,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:29:58,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:29:58,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:29:58,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:29:58,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:29:58,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:29:58,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:29:58,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:29:58,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:29:58,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:29:58,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:29:58,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:29:58,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:29:58,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:29:58,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:29:58,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:29:58,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:29:58,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:29:58,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:29:58,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:29:58,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:29:58,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:29:58,251 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-05 18:29:58,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:29:58,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:29:58,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:29:58,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:29:58,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:29:58,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:29:58,309 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:29:58,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:29:58,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:29:58,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:29:58,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:29:58,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:29:58,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:29:58,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:29:58,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:29:58,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:29:58,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:29:58,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:29:58,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:29:58,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:29:58,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:29:58,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:29:58,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:29:58,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:29:58,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:29:58,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:29:58,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:29:58,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:29:58,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:29:58,312 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:29:58,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:29:58,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 18:29:58,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:29:58,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:29:58,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:29:58,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:29:58,811 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:29:58,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-05 18:29:59,807 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:30:00,021 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:30:00,022 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-05 18:30:00,036 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a6f48c5/629304c3240c435e8a982cdcf9ca0600/FLAG0abc885cd [2022-12-05 18:30:00,050 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a6f48c5/629304c3240c435e8a982cdcf9ca0600 [2022-12-05 18:30:00,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:30:00,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:30:00,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:30:00,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:30:00,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:30:00,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00, skipping insertion in model container [2022-12-05 18:30:00,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:30:00,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:30:00,322 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-05 18:30:00,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:30:00,601 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:30:00,611 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-05 18:30:00,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:30:00,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:30:00,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:30:00,708 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:30:00,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00 WrapperNode [2022-12-05 18:30:00,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:30:00,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:30:00,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:30:00,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:30:00,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,774 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-12-05 18:30:00,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:30:00,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:30:00,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:30:00,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:30:00,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,801 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:30:00,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:30:00,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:30:00,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:30:00,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (1/1) ... [2022-12-05 18:30:00,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:30:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:30:00,846 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-05 18:30:00,862 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-05 18:30:00,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:30:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:30:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:30:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:30:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:30:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:30:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:30:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:30:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:30:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:30:00,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:30:00,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:30:00,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:30:00,883 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 18:30:01,046 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:30:01,049 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:30:01,245 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:30:01,368 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:30:01,368 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:30:01,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:30:01 BoogieIcfgContainer [2022-12-05 18:30:01,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:30:01,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:30:01,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:30:01,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:30:01,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:30:00" (1/3) ... [2022-12-05 18:30:01,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3745730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:30:01, skipping insertion in model container [2022-12-05 18:30:01,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:30:00" (2/3) ... [2022-12-05 18:30:01,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3745730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:30:01, skipping insertion in model container [2022-12-05 18:30:01,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:30:01" (3/3) ... [2022-12-05 18:30:01,376 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-05 18:30:01,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:30:01,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:30:01,389 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:30:01,430 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:30:01,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 18:30:01,505 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-05 18:30:01,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:30:01,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-05 18:30:01,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 18:30:01,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-05 18:30:01,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:30:01,535 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;@58fc3778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:30:01,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 18:30:01,551 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-05 18:30:01,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:30:01,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:30:01,552 INFO L213 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] [2022-12-05 18:30:01,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:30:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:30:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1241426171, now seen corresponding path program 1 times [2022-12-05 18:30:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:30:01,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727403537] [2022-12-05 18:30:01,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:30:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:30:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:30:01,970 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-05 18:30:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:30:01,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727403537] [2022-12-05 18:30:01,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727403537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:30:01,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:30:01,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:30:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524911769] [2022-12-05 18:30:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:30:01,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:30:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:30:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:30:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:30:02,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 90 [2022-12-05 18:30:02,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-05 18:30:02,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:30:02,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 90 [2022-12-05 18:30:02,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:30:02,109 INFO L130 PetriNetUnfolder]: 18/143 cut-off events. [2022-12-05 18:30:02,110 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 18:30:02,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 143 events. 18/143 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 364 event pairs, 2 based on Foata normal form. 10/144 useless extension candidates. Maximal degree in co-relation 149. Up to 31 conditions per place. [2022-12-05 18:30:02,112 INFO L137 encePairwiseOnDemand]: 85/90 looper letters, 10 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2022-12-05 18:30:02,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 88 transitions, 209 flow [2022-12-05 18:30:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:30:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:30:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2022-12-05 18:30:02,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9296296296296296 [2022-12-05 18:30:02,125 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 182 flow. Second operand 3 states and 251 transitions. [2022-12-05 18:30:02,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 88 transitions, 209 flow [2022-12-05 18:30:02,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 88 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:30:02,130 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 176 flow [2022-12-05 18:30:02,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2022-12-05 18:30:02,134 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2022-12-05 18:30:02,134 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 176 flow [2022-12-05 18:30:02,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-05 18:30:02,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:30:02,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:30:02,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:30:02,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:30:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:30:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1642137115, now seen corresponding path program 1 times [2022-12-05 18:30:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:30:02,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524277789] [2022-12-05 18:30:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:30:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:30:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:30:02,432 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-05 18:30:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:30:02,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524277789] [2022-12-05 18:30:02,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524277789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:30:02,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:30:02,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:30:02,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039485693] [2022-12-05 18:30:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:30:02,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:30:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:30:02,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:30:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:30:02,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2022-12-05 18:30:02,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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-05 18:30:02,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:30:02,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2022-12-05 18:30:02,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:30:02,814 INFO L130 PetriNetUnfolder]: 173/564 cut-off events. [2022-12-05 18:30:02,814 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-05 18:30:02,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 564 events. 173/564 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3105 event pairs, 46 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 892. Up to 166 conditions per place. [2022-12-05 18:30:02,821 INFO L137 encePairwiseOnDemand]: 84/90 looper letters, 16 selfloop transitions, 2 changer transitions 38/117 dead transitions. [2022-12-05 18:30:02,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 117 transitions, 354 flow [2022-12-05 18:30:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:30:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:30:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 681 transitions. [2022-12-05 18:30:02,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2022-12-05 18:30:02,829 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 176 flow. Second operand 9 states and 681 transitions. [2022-12-05 18:30:02,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 117 transitions, 354 flow [2022-12-05 18:30:02,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 117 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:30:02,832 INFO L231 Difference]: Finished difference. Result has 104 places, 76 transitions, 176 flow [2022-12-05 18:30:02,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=176, PETRI_PLACES=104, PETRI_TRANSITIONS=76} [2022-12-05 18:30:02,833 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 11 predicate places. [2022-12-05 18:30:02,833 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 76 transitions, 176 flow [2022-12-05 18:30:02,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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-05 18:30:02,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:30:02,833 INFO L213 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] [2022-12-05 18:30:02,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:30:02,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:30:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:30:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash 782724315, now seen corresponding path program 1 times [2022-12-05 18:30:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:30:02,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412336674] [2022-12-05 18:30:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:30:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:30:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:30:03,187 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-05 18:30:03,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:30:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412336674] [2022-12-05 18:30:03,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412336674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:30:03,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:30:03,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:30:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134515487] [2022-12-05 18:30:03,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:30:03,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:30:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:30:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:30:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:30:03,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 90 [2022-12-05 18:30:03,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 76 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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-05 18:30:03,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:30:03,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 90 [2022-12-05 18:30:03,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:30:03,393 INFO L130 PetriNetUnfolder]: 167/472 cut-off events. [2022-12-05 18:30:03,394 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 18:30:03,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 472 events. 167/472 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2395 event pairs, 18 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 824. Up to 79 conditions per place. [2022-12-05 18:30:03,396 INFO L137 encePairwiseOnDemand]: 81/90 looper letters, 24 selfloop transitions, 5 changer transitions 40/128 dead transitions. [2022-12-05 18:30:03,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 420 flow [2022-12-05 18:30:03,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:30:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:30:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 761 transitions. [2022-12-05 18:30:03,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8455555555555555 [2022-12-05 18:30:03,398 INFO L175 Difference]: Start difference. First operand has 104 places, 76 transitions, 176 flow. Second operand 10 states and 761 transitions. [2022-12-05 18:30:03,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 420 flow [2022-12-05 18:30:03,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 128 transitions, 404 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-05 18:30:03,401 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 202 flow [2022-12-05 18:30:03,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=202, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2022-12-05 18:30:03,402 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 4 predicate places. [2022-12-05 18:30:03,402 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 202 flow [2022-12-05 18:30:03,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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-05 18:30:03,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:30:03,403 INFO L213 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] [2022-12-05 18:30:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:30:03,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:30:03,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:30:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1961950114, now seen corresponding path program 1 times [2022-12-05 18:30:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:30:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303325215] [2022-12-05 18:30:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:30:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:30:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:30:03,591 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-05 18:30:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:30:03,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303325215] [2022-12-05 18:30:03,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303325215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:30:03,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:30:03,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:30:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414813620] [2022-12-05 18:30:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:30:03,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:30:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:30:03,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:30:03,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:30:03,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 90 [2022-12-05 18:30:03,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 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-05 18:30:03,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:30:03,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 90 [2022-12-05 18:30:03,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:30:03,731 INFO L130 PetriNetUnfolder]: 35/172 cut-off events. [2022-12-05 18:30:03,731 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-05 18:30:03,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 172 events. 35/172 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 479 event pairs, 6 based on Foata normal form. 7/176 useless extension candidates. Maximal degree in co-relation 355. Up to 26 conditions per place. [2022-12-05 18:30:03,732 INFO L137 encePairwiseOnDemand]: 82/90 looper letters, 16 selfloop transitions, 7 changer transitions 19/101 dead transitions. [2022-12-05 18:30:03,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 379 flow [2022-12-05 18:30:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:30:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:30:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 734 transitions. [2022-12-05 18:30:03,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8155555555555556 [2022-12-05 18:30:03,734 INFO L175 Difference]: Start difference. First operand has 97 places, 77 transitions, 202 flow. Second operand 10 states and 734 transitions. [2022-12-05 18:30:03,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 379 flow [2022-12-05 18:30:03,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 340 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-05 18:30:03,737 INFO L231 Difference]: Finished difference. Result has 100 places, 77 transitions, 214 flow [2022-12-05 18:30:03,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=100, PETRI_TRANSITIONS=77} [2022-12-05 18:30:03,738 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 7 predicate places. [2022-12-05 18:30:03,738 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 77 transitions, 214 flow [2022-12-05 18:30:03,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 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-05 18:30:03,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:30:03,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:30:03,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:30:03,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:30:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:30:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash 590781897, now seen corresponding path program 1 times [2022-12-05 18:30:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:30:03,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096459584] [2022-12-05 18:30:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:30:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:30:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:30:03,940 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-05 18:30:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:30:03,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096459584] [2022-12-05 18:30:03,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096459584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:30:03,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:30:03,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:30:03,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448516695] [2022-12-05 18:30:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:30:03,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:30:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:30:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:30:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:30:03,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 90 [2022-12-05 18:30:03,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 77 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 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-05 18:30:03,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:30:03,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 90 [2022-12-05 18:30:03,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:30:04,101 INFO L130 PetriNetUnfolder]: 19/158 cut-off events. [2022-12-05 18:30:04,101 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-05 18:30:04,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 158 events. 19/158 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 367 event pairs, 3 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 271. Up to 34 conditions per place. [2022-12-05 18:30:04,102 INFO L137 encePairwiseOnDemand]: 80/90 looper letters, 20 selfloop transitions, 6 changer transitions 6/89 dead transitions. [2022-12-05 18:30:04,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 302 flow [2022-12-05 18:30:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 18:30:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 18:30:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 553 transitions. [2022-12-05 18:30:04,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7680555555555556 [2022-12-05 18:30:04,104 INFO L175 Difference]: Start difference. First operand has 100 places, 77 transitions, 214 flow. Second operand 8 states and 553 transitions. [2022-12-05 18:30:04,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 89 transitions, 302 flow [2022-12-05 18:30:04,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 256 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-12-05 18:30:04,106 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 207 flow [2022-12-05 18:30:04,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2022-12-05 18:30:04,107 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 2 predicate places. [2022-12-05 18:30:04,107 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 207 flow [2022-12-05 18:30:04,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 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-05 18:30:04,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:30:04,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:30:04,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:30:04,107 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:30:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:30:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1419969411, now seen corresponding path program 2 times [2022-12-05 18:30:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:30:04,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333028145] [2022-12-05 18:30:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:30:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:30:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:30:05,016 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-05 18:30:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:30:05,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333028145] [2022-12-05 18:30:05,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333028145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:30:05,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:30:05,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:30:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919372317] [2022-12-05 18:30:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:30:05,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:30:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:30:05,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:30:05,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:30:05,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 90 [2022-12-05 18:30:05,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 207 flow. Second operand has 13 states, 13 states have (on average 59.15384615384615) internal successors, (769), 13 states have internal predecessors, (769), 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-05 18:30:05,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:30:05,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 90 [2022-12-05 18:30:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:30:05,379 INFO L130 PetriNetUnfolder]: 17/182 cut-off events. [2022-12-05 18:30:05,380 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 18:30:05,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 182 events. 17/182 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 547 event pairs, 2 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 317. Up to 22 conditions per place. [2022-12-05 18:30:05,381 INFO L137 encePairwiseOnDemand]: 78/90 looper letters, 27 selfloop transitions, 7 changer transitions 13/96 dead transitions. [2022-12-05 18:30:05,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 359 flow [2022-12-05 18:30:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:30:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:30:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 727 transitions. [2022-12-05 18:30:05,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6731481481481482 [2022-12-05 18:30:05,383 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 207 flow. Second operand 12 states and 727 transitions. [2022-12-05 18:30:05,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 96 transitions, 359 flow [2022-12-05 18:30:05,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 344 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-05 18:30:05,385 INFO L231 Difference]: Finished difference. Result has 103 places, 80 transitions, 223 flow [2022-12-05 18:30:05,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=223, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2022-12-05 18:30:05,386 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 10 predicate places. [2022-12-05 18:30:05,386 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 80 transitions, 223 flow [2022-12-05 18:30:05,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 59.15384615384615) internal successors, (769), 13 states have internal predecessors, (769), 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-05 18:30:05,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:30:05,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:30:05,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:30:05,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 18:30:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:30:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1541210065, now seen corresponding path program 3 times [2022-12-05 18:30:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:30:05,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776705746] [2022-12-05 18:30:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:30:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:30:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:30:05,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:30:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:30:05,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:30:05,459 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:30:05,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 18:30:05,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 18:30:05,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 18:30:05,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 18:30:05,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 18:30:05,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:30:05,461 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-12-05 18:30:05,466 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:30:05,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:30:05,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:30:05 BasicIcfg [2022-12-05 18:30:05,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:30:05,513 INFO L158 Benchmark]: Toolchain (without parser) took 5460.79ms. Allocated memory was 198.2MB in the beginning and 350.2MB in the end (delta: 152.0MB). Free memory was 172.6MB in the beginning and 159.6MB in the end (delta: 13.0MB). Peak memory consumption was 165.0MB. Max. memory is 8.0GB. [2022-12-05 18:30:05,513 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:30:05,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.16ms. Allocated memory is still 198.2MB. Free memory was 172.1MB in the beginning and 147.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 18:30:05,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.41ms. Allocated memory is still 198.2MB. Free memory was 147.4MB in the beginning and 144.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:30:05,514 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 198.2MB. Free memory was 144.9MB in the beginning and 143.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:30:05,515 INFO L158 Benchmark]: RCFGBuilder took 565.37ms. Allocated memory was 198.2MB in the beginning and 262.1MB in the end (delta: 64.0MB). Free memory was 143.2MB in the beginning and 234.0MB in the end (delta: -90.8MB). Peak memory consumption was 30.3MB. Max. memory is 8.0GB. [2022-12-05 18:30:05,515 INFO L158 Benchmark]: TraceAbstraction took 4141.22ms. Allocated memory was 262.1MB in the beginning and 350.2MB in the end (delta: 88.1MB). Free memory was 232.9MB in the beginning and 159.6MB in the end (delta: 73.3MB). Peak memory consumption was 161.9MB. Max. memory is 8.0GB. [2022-12-05 18:30:05,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 175.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 655.16ms. Allocated memory is still 198.2MB. Free memory was 172.1MB in the beginning and 147.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.41ms. Allocated memory is still 198.2MB. Free memory was 147.4MB in the beginning and 144.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 198.2MB. Free memory was 144.9MB in the beginning and 143.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 565.37ms. Allocated memory was 198.2MB in the beginning and 262.1MB in the end (delta: 64.0MB). Free memory was 143.2MB in the beginning and 234.0MB in the end (delta: -90.8MB). Peak memory consumption was 30.3MB. Max. memory is 8.0GB. * TraceAbstraction took 4141.22ms. Allocated memory was 262.1MB in the beginning and 350.2MB in the end (delta: 88.1MB). Free memory was 232.9MB in the beginning and 159.6MB in the end (delta: 73.3MB). Peak memory consumption was 161.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L722] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L723] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L724] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L725] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L730] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L731] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L732] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L733] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L734] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t305; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t306; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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 5 procedures, 109 locations, 5 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: 4.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 54 mSDtfsCounter, 544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-05 18:30:05,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...