/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:39:05,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:39:05,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:39:05,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:39:05,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:39:05,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:39:05,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:39:05,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:39:05,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:39:05,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:39:05,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:39:05,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:39:05,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:39:05,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:39:05,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:39:05,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:39:05,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:39:05,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:39:05,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:39:05,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:39:05,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:39:05,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:39:05,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:39:05,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:39:05,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:39:05,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:39:05,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:39:05,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:39:05,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:39:05,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:39:05,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:39:05,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:39:05,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:39:05,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:39:05,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:39:05,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:39:05,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:39:05,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:39:05,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:39:05,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:39:05,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:39:05,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:39:05,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:39:05,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:39:05,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:39:05,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:39:05,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:39:05,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:39:05,620 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:39:05,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:39:05,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:39:05,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:39:05,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:39:05,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:39:05,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:39:05,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:39:05,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:39:05,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:39:05,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:39:05,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:39:05,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:39:05,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:39:05,933 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:39:05,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-12-12 18:39:06,985 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:39:07,269 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:39:07,270 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-12-12 18:39:07,289 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed4fb9ee/953a1d2f6b8145fbb565a5f0abda9d08/FLAG23a531f9a [2022-12-12 18:39:07,304 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed4fb9ee/953a1d2f6b8145fbb565a5f0abda9d08 [2022-12-12 18:39:07,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:39:07,308 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:39:07,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:39:07,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:39:07,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:39:07,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fe03c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07, skipping insertion in model container [2022-12-12 18:39:07,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:39:07,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:39:07,531 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-12 18:39:07,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:39:07,726 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:39:07,733 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-12 18:39:07,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:07,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:07,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:39:07,804 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:39:07,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07 WrapperNode [2022-12-12 18:39:07,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:39:07,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:39:07,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:39:07,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:39:07,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,857 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-12 18:39:07,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:39:07,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:39:07,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:39:07,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:39:07,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,884 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:39:07,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:39:07,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:39:07,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:39:07,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (1/1) ... [2022-12-12 18:39:07,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:39:07,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:39:07,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:39:07,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:39:07,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:39:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:39:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:39:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:39:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:39:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:39:07,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:39:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:39:07,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:39:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:39:07,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:39:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:39:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:39:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:39:07,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:39:07,970 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:39:08,067 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:39:08,068 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:39:08,235 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:39:08,345 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:39:08,346 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:39:08,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:39:08 BoogieIcfgContainer [2022-12-12 18:39:08,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:39:08,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:39:08,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:39:08,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:39:08,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:39:07" (1/3) ... [2022-12-12 18:39:08,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6f94a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:39:08, skipping insertion in model container [2022-12-12 18:39:08,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:07" (2/3) ... [2022-12-12 18:39:08,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6f94a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:39:08, skipping insertion in model container [2022-12-12 18:39:08,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:39:08" (3/3) ... [2022-12-12 18:39:08,353 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2022-12-12 18:39:08,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:39:08,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:39:08,365 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:39:08,420 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:39:08,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 18:39:08,509 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 18:39:08,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:08,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-12 18:39:08,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 18:39:08,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:08,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:39:08,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:08,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:08,550 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 18:39:08,550 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:08,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-12 18:39:08,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:08,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 1676 [2022-12-12 18:39:12,230 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-12 18:39:12,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:39:12,246 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;@2821cf4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:39:12,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:39:12,250 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-12 18:39:12,250 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:12,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:12,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:12,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1687281307, now seen corresponding path program 1 times [2022-12-12 18:39:12,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:12,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687959769] [2022-12-12 18:39:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:12,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687959769] [2022-12-12 18:39:12,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687959769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:12,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:12,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:39:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084491240] [2022-12-12 18:39:12,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:12,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:12,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:12,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2022-12-12 18:39:12,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:12,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:12,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2022-12-12 18:39:12,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:13,497 INFO L130 PetriNetUnfolder]: 5844/9448 cut-off events. [2022-12-12 18:39:13,498 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-12 18:39:13,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17896 conditions, 9448 events. 5844/9448 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 68715 event pairs, 824 based on Foata normal form. 0/5702 useless extension candidates. Maximal degree in co-relation 17885. Up to 7021 conditions per place. [2022-12-12 18:39:13,523 INFO L137 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 42/82 dead transitions. [2022-12-12 18:39:13,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 82 transitions, 317 flow [2022-12-12 18:39:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-12-12 18:39:13,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-12 18:39:13,535 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2022-12-12 18:39:13,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 82 transitions, 317 flow [2022-12-12 18:39:13,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 40 transitions, 149 flow [2022-12-12 18:39:13,550 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 149 flow [2022-12-12 18:39:13,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:13,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:13,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:13,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:39:13,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2020327964, now seen corresponding path program 1 times [2022-12-12 18:39:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:13,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83611802] [2022-12-12 18:39:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:13,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:13,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83611802] [2022-12-12 18:39:13,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83611802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:13,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:13,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:39:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638062048] [2022-12-12 18:39:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:13,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:13,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2022-12-12 18:39:13,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:13,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:13,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2022-12-12 18:39:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:13,877 INFO L130 PetriNetUnfolder]: 1436/2405 cut-off events. [2022-12-12 18:39:13,877 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-12 18:39:13,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6440 conditions, 2405 events. 1436/2405 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13242 event pairs, 91 based on Foata normal form. 10/2020 useless extension candidates. Maximal degree in co-relation 6426. Up to 2017 conditions per place. [2022-12-12 18:39:13,890 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 44 selfloop transitions, 4 changer transitions 2/58 dead transitions. [2022-12-12 18:39:13,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 323 flow [2022-12-12 18:39:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-12 18:39:13,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3765432098765432 [2022-12-12 18:39:13,892 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -19 predicate places. [2022-12-12 18:39:13,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 58 transitions, 323 flow [2022-12-12 18:39:13,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 56 transitions, 315 flow [2022-12-12 18:39:13,902 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 56 transitions, 315 flow [2022-12-12 18:39:13,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:13,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:13,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:13,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:39:13,903 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1794344074, now seen corresponding path program 1 times [2022-12-12 18:39:13,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:13,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78653598] [2022-12-12 18:39:13,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:14,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78653598] [2022-12-12 18:39:14,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78653598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:14,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:14,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185566237] [2022-12-12 18:39:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:14,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:14,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:14,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 18:39:14,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 56 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:14,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:14,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 18:39:14,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:14,370 INFO L130 PetriNetUnfolder]: 1981/3143 cut-off events. [2022-12-12 18:39:14,371 INFO L131 PetriNetUnfolder]: For 1583/1583 co-relation queries the response was YES. [2022-12-12 18:39:14,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11170 conditions, 3143 events. 1981/3143 cut-off events. For 1583/1583 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 17080 event pairs, 233 based on Foata normal form. 216/2873 useless extension candidates. Maximal degree in co-relation 11153. Up to 2509 conditions per place. [2022-12-12 18:39:14,383 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 58 selfloop transitions, 16 changer transitions 56/137 dead transitions. [2022-12-12 18:39:14,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 137 transitions, 1031 flow [2022-12-12 18:39:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-12 18:39:14,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2022-12-12 18:39:14,385 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -16 predicate places. [2022-12-12 18:39:14,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 137 transitions, 1031 flow [2022-12-12 18:39:14,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 81 transitions, 607 flow [2022-12-12 18:39:14,394 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 81 transitions, 607 flow [2022-12-12 18:39:14,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:14,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:14,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:14,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:39:14,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1365823974, now seen corresponding path program 1 times [2022-12-12 18:39:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:14,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100489814] [2022-12-12 18:39:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:14,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100489814] [2022-12-12 18:39:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100489814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:14,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:14,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886493349] [2022-12-12 18:39:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:14,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:14,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:14,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2022-12-12 18:39:14,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 81 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:14,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:14,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2022-12-12 18:39:14,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:14,791 INFO L130 PetriNetUnfolder]: 2405/3856 cut-off events. [2022-12-12 18:39:14,791 INFO L131 PetriNetUnfolder]: For 3611/3646 co-relation queries the response was YES. [2022-12-12 18:39:14,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16793 conditions, 3856 events. 2405/3856 cut-off events. For 3611/3646 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 22020 event pairs, 335 based on Foata normal form. 146/3361 useless extension candidates. Maximal degree in co-relation 16773. Up to 3516 conditions per place. [2022-12-12 18:39:14,809 INFO L137 encePairwiseOnDemand]: 51/54 looper letters, 91 selfloop transitions, 6 changer transitions 9/117 dead transitions. [2022-12-12 18:39:14,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 117 transitions, 1113 flow [2022-12-12 18:39:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-12 18:39:14,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38271604938271603 [2022-12-12 18:39:14,811 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -16 predicate places. [2022-12-12 18:39:14,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 117 transitions, 1113 flow [2022-12-12 18:39:14,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 108 transitions, 1023 flow [2022-12-12 18:39:14,825 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 108 transitions, 1023 flow [2022-12-12 18:39:14,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:14,825 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:14,825 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:14,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:39:14,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 189526557, now seen corresponding path program 1 times [2022-12-12 18:39:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:14,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311899299] [2022-12-12 18:39:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:14,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:14,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311899299] [2022-12-12 18:39:14,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311899299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:14,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:14,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059294841] [2022-12-12 18:39:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:14,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:14,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 18:39:14,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 108 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:14,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:14,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 18:39:14,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:15,283 INFO L130 PetriNetUnfolder]: 1694/3021 cut-off events. [2022-12-12 18:39:15,283 INFO L131 PetriNetUnfolder]: For 3236/3281 co-relation queries the response was YES. [2022-12-12 18:39:15,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16197 conditions, 3021 events. 1694/3021 cut-off events. For 3236/3281 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 19231 event pairs, 103 based on Foata normal form. 320/2840 useless extension candidates. Maximal degree in co-relation 16174. Up to 2781 conditions per place. [2022-12-12 18:39:15,296 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 71 selfloop transitions, 39 changer transitions 78/195 dead transitions. [2022-12-12 18:39:15,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 195 transitions, 2221 flow [2022-12-12 18:39:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2022-12-12 18:39:15,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2022-12-12 18:39:15,298 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -11 predicate places. [2022-12-12 18:39:15,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 195 transitions, 2221 flow [2022-12-12 18:39:15,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 117 transitions, 1318 flow [2022-12-12 18:39:15,309 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 117 transitions, 1318 flow [2022-12-12 18:39:15,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:15,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:15,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:15,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:39:15,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2038035174, now seen corresponding path program 1 times [2022-12-12 18:39:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:15,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860804436] [2022-12-12 18:39:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:15,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860804436] [2022-12-12 18:39:15,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860804436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:15,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:15,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:39:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662120573] [2022-12-12 18:39:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:15,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:39:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:15,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:39:15,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:39:15,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2022-12-12 18:39:15,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 117 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:15,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:15,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2022-12-12 18:39:15,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:15,632 INFO L130 PetriNetUnfolder]: 647/1449 cut-off events. [2022-12-12 18:39:15,632 INFO L131 PetriNetUnfolder]: For 2486/2525 co-relation queries the response was YES. [2022-12-12 18:39:15,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8997 conditions, 1449 events. 647/1449 cut-off events. For 2486/2525 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9726 event pairs, 4 based on Foata normal form. 196/1431 useless extension candidates. Maximal degree in co-relation 8971. Up to 1263 conditions per place. [2022-12-12 18:39:15,638 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 47 selfloop transitions, 48 changer transitions 33/133 dead transitions. [2022-12-12 18:39:15,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 133 transitions, 1744 flow [2022-12-12 18:39:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:39:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:39:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-12 18:39:15,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3253968253968254 [2022-12-12 18:39:15,641 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2022-12-12 18:39:15,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 133 transitions, 1744 flow [2022-12-12 18:39:15,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 100 transitions, 1320 flow [2022-12-12 18:39:15,645 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 100 transitions, 1320 flow [2022-12-12 18:39:15,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:15,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:15,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:15,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:39:15,645 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:15,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1455971252, now seen corresponding path program 1 times [2022-12-12 18:39:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:15,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972820305] [2022-12-12 18:39:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:15,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:15,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972820305] [2022-12-12 18:39:15,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972820305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:15,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:15,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886642915] [2022-12-12 18:39:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:15,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:15,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 54 [2022-12-12 18:39:15,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 100 transitions, 1320 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:15,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:15,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 54 [2022-12-12 18:39:15,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:15,887 INFO L130 PetriNetUnfolder]: 506/1012 cut-off events. [2022-12-12 18:39:15,888 INFO L131 PetriNetUnfolder]: For 2392/2414 co-relation queries the response was YES. [2022-12-12 18:39:15,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7247 conditions, 1012 events. 506/1012 cut-off events. For 2392/2414 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5486 event pairs, 0 based on Foata normal form. 35/852 useless extension candidates. Maximal degree in co-relation 7218. Up to 923 conditions per place. [2022-12-12 18:39:15,892 INFO L137 encePairwiseOnDemand]: 51/54 looper letters, 54 selfloop transitions, 2 changer transitions 83/151 dead transitions. [2022-12-12 18:39:15,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 151 transitions, 2304 flow [2022-12-12 18:39:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-12 18:39:15,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3425925925925926 [2022-12-12 18:39:15,893 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2022-12-12 18:39:15,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 151 transitions, 2304 flow [2022-12-12 18:39:15,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 68 transitions, 975 flow [2022-12-12 18:39:15,897 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 68 transitions, 975 flow [2022-12-12 18:39:15,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:15,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:15,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:15,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:39:15,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 472175999, now seen corresponding path program 1 times [2022-12-12 18:39:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:15,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834013990] [2022-12-12 18:39:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834013990] [2022-12-12 18:39:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834013990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:16,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:16,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:16,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164395371] [2022-12-12 18:39:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:16,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:16,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:16,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:16,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2022-12-12 18:39:16,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 68 transitions, 975 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:16,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:16,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2022-12-12 18:39:16,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:16,641 INFO L130 PetriNetUnfolder]: 269/631 cut-off events. [2022-12-12 18:39:16,641 INFO L131 PetriNetUnfolder]: For 1041/1042 co-relation queries the response was YES. [2022-12-12 18:39:16,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 631 events. 269/631 cut-off events. For 1041/1042 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3673 event pairs, 0 based on Foata normal form. 28/525 useless extension candidates. Maximal degree in co-relation 4947. Up to 603 conditions per place. [2022-12-12 18:39:16,644 INFO L137 encePairwiseOnDemand]: 49/54 looper letters, 37 selfloop transitions, 3 changer transitions 55/107 dead transitions. [2022-12-12 18:39:16,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 107 transitions, 1787 flow [2022-12-12 18:39:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-12 18:39:16,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28703703703703703 [2022-12-12 18:39:16,645 INFO L295 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2022-12-12 18:39:16,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 107 transitions, 1787 flow [2022-12-12 18:39:16,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 52 transitions, 813 flow [2022-12-12 18:39:16,647 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 813 flow [2022-12-12 18:39:16,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:16,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:16,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:16,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:39:16,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:16,648 INFO L85 PathProgramCache]: Analyzing trace with hash 60273139, now seen corresponding path program 2 times [2022-12-12 18:39:16,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:16,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081114012] [2022-12-12 18:39:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:16,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:39:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:16,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:39:16,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:39:16,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:39:16,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:39:16,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:39:16,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:39:16,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:39:16,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:39:16,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:39:16,703 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:16,708 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:39:16,708 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:39:16,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:39:16 BasicIcfg [2022-12-12 18:39:16,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:39:16,756 INFO L158 Benchmark]: Toolchain (without parser) took 9447.37ms. Allocated memory was 166.7MB in the beginning and 472.9MB in the end (delta: 306.2MB). Free memory was 141.7MB in the beginning and 238.4MB in the end (delta: -96.8MB). Peak memory consumption was 210.0MB. Max. memory is 8.0GB. [2022-12-12 18:39:16,756 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 166.7MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:39:16,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.34ms. Allocated memory is still 166.7MB. Free memory was 141.1MB in the beginning and 116.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 18:39:16,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.73ms. Allocated memory is still 166.7MB. Free memory was 116.0MB in the beginning and 113.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:39:16,756 INFO L158 Benchmark]: Boogie Preprocessor took 27.78ms. Allocated memory is still 166.7MB. Free memory was 113.3MB in the beginning and 111.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 18:39:16,757 INFO L158 Benchmark]: RCFGBuilder took 460.49ms. Allocated memory was 166.7MB in the beginning and 203.4MB in the end (delta: 36.7MB). Free memory was 111.8MB in the beginning and 175.0MB in the end (delta: -63.2MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2022-12-12 18:39:16,757 INFO L158 Benchmark]: TraceAbstraction took 8406.23ms. Allocated memory was 203.4MB in the beginning and 472.9MB in the end (delta: 269.5MB). Free memory was 173.9MB in the beginning and 238.4MB in the end (delta: -64.5MB). Peak memory consumption was 205.0MB. Max. memory is 8.0GB. [2022-12-12 18:39:16,758 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.11ms. Allocated memory is still 166.7MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.34ms. Allocated memory is still 166.7MB. Free memory was 141.1MB in the beginning and 116.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.73ms. Allocated memory is still 166.7MB. Free memory was 116.0MB in the beginning and 113.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.78ms. Allocated memory is still 166.7MB. Free memory was 113.3MB in the beginning and 111.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 460.49ms. Allocated memory was 166.7MB in the beginning and 203.4MB in the end (delta: 36.7MB). Free memory was 111.8MB in the beginning and 175.0MB in the end (delta: -63.2MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. * TraceAbstraction took 8406.23ms. Allocated memory was 203.4MB in the beginning and 472.9MB in the end (delta: 269.5MB). Free memory was 173.9MB in the beginning and 238.4MB in the end (delta: -64.5MB). Peak memory consumption was 205.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 111 PlacesBefore, 63 PlacesAfterwards, 103 TransitionsBefore, 54 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 3114, independent unconditional: 0, dependent: 107, dependent conditional: 107, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 0, independent unconditional: 3114, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 0, independent unconditional: 3114, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3221, independent: 3114, independent conditional: 0, independent unconditional: 3114, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1625, independent: 1591, independent conditional: 0, independent unconditional: 1591, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1625, independent: 1556, independent conditional: 0, independent unconditional: 1556, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3221, independent: 1523, independent conditional: 0, independent unconditional: 1523, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 1625, unknown conditional: 0, unknown unconditional: 1625] , Statistics on independence cache: Total cache size (in pairs): 3658, Positive cache size: 3624, Positive conditional cache size: 0, Positive unconditional cache size: 3624, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=-1, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=0, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=1, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 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) [L766] 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)) [L767] 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)) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 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 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 230 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 696 IncrementalHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 3 mSDtfsCounter, 696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1320occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 4320 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:39:16,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...