/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:35:45,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:35:45,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:35:45,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:35:45,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:35:45,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:35:45,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:35:45,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:35:45,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:35:45,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:35:45,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:35:45,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:35:45,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:35:45,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:35:45,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:35:45,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:35:45,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:35:45,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:35:45,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:35:45,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:35:45,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:35:45,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:35:45,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:35:45,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:35:45,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:35:45,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:35:45,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:35:45,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:35:45,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:35:45,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:35:45,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:35:45,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:35:45,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:35:45,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:35:45,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:35:45,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:35:45,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:35:45,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:35:45,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:35:45,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:35:45,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:35:45,498 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 21:35:45,530 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:35:45,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:35:45,531 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:35:45,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:35:45,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:35:45,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:35:45,533 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:35:45,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:35:45,534 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:35:45,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:35:45,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:35:45,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:35:45,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:35:45,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:35:45,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:35:45,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:35:45,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:35:45,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:35:45,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:35:45,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:35:45,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:35:45,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:35:45,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:35:45,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:35:45,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:35:45,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:35:45,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:35:45,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:35:45,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:35:45,537 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:35:45,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:35:45,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:35:45,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:35:45,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:35:45,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:35:45,900 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:35:45,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:35:47,174 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:35:47,465 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:35:47,465 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:35:47,481 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de08a7bc6/d69ebd98f5a2425f89e089ded46fa09b/FLAG2c8f2652e [2022-12-12 21:35:47,492 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de08a7bc6/d69ebd98f5a2425f89e089ded46fa09b [2022-12-12 21:35:47,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:35:47,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:35:47,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:35:47,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:35:47,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:35:47,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:47,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42715d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47, skipping insertion in model container [2022-12-12 21:35:47,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:47,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:35:47,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:35:47,673 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-12 21:35:47,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:35:47,864 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:35:47,877 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-12 21:35:47,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:35:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:35:47,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:35:47,992 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:35:47,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47 WrapperNode [2022-12-12 21:35:47,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:35:47,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:35:47,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:35:47,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:35:48,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,060 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-12 21:35:48,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:35:48,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:35:48,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:35:48,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:35:48,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,095 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:35:48,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:35:48,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:35:48,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:35:48,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (1/1) ... [2022-12-12 21:35:48,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:35:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:35:48,136 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 21:35:48,156 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 21:35:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:35:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:35:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:35:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:35:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:35:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:35:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:35:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:35:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:35:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:35:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:35:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 21:35:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 21:35:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:35:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:35:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:35:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:35:48,175 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 21:35:48,367 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:35:48,369 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:35:48,690 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:35:48,813 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:35:48,813 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:35:48,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:35:48 BoogieIcfgContainer [2022-12-12 21:35:48,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:35:48,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:35:48,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:35:48,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:35:48,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:35:47" (1/3) ... [2022-12-12 21:35:48,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73651ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:35:48, skipping insertion in model container [2022-12-12 21:35:48,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:35:47" (2/3) ... [2022-12-12 21:35:48,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73651ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:35:48, skipping insertion in model container [2022-12-12 21:35:48,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:35:48" (3/3) ... [2022-12-12 21:35:48,823 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:35:48,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:35:48,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:35:48,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:35:48,891 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:35:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-12 21:35:48,994 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-12 21:35:48,994 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:35:49,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-12 21:35:49,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-12 21:35:49,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-12 21:35:49,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:35:49,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-12 21:35:49,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-12 21:35:49,080 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-12 21:35:49,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:35:49,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-12 21:35:49,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-12 21:35:49,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-12 21:35:59,001 INFO L241 LiptonReduction]: Total number of compositions: 98 [2022-12-12 21:35:59,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:35:59,027 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;@7491f89e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:35:59,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 21:35:59,035 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-12 21:35:59,035 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:35:59,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:35:59,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:35:59,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:35:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:35:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1718137257, now seen corresponding path program 1 times [2022-12-12 21:35:59,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:35:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83802261] [2022-12-12 21:35:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:35:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:35:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:35:59,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 21:35:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:35:59,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83802261] [2022-12-12 21:35:59,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83802261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:35:59,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:35:59,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:35:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943781973] [2022-12-12 21:35:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:35:59,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:35:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:35:59,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:35:59,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:35:59,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 72 [2022-12-12 21:35:59,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:35:59,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:35:59,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 72 [2022-12-12 21:35:59,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:06,150 INFO L130 PetriNetUnfolder]: 45079/65069 cut-off events. [2022-12-12 21:36:06,151 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-12 21:36:06,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125053 conditions, 65069 events. 45079/65069 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 3600. Compared 495417 event pairs, 11775 based on Foata normal form. 0/39954 useless extension candidates. Maximal degree in co-relation 125041. Up to 50025 conditions per place. [2022-12-12 21:36:06,394 INFO L137 encePairwiseOnDemand]: 67/72 looper letters, 40 selfloop transitions, 2 changer transitions 56/113 dead transitions. [2022-12-12 21:36:06,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 113 transitions, 437 flow [2022-12-12 21:36:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-12-12 21:36:06,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2022-12-12 21:36:06,411 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 0 predicate places. [2022-12-12 21:36:06,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 113 transitions, 437 flow [2022-12-12 21:36:06,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 213 flow [2022-12-12 21:36:06,492 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 213 flow [2022-12-12 21:36:06,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:06,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:06,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:06,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:36:06,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1222412776, now seen corresponding path program 1 times [2022-12-12 21:36:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:06,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002786581] [2022-12-12 21:36:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:07,941 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 21:36:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:07,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002786581] [2022-12-12 21:36:07,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002786581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:07,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:07,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:36:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111906436] [2022-12-12 21:36:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:07,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:07,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:07,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 21:36:07,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:07,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:07,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 21:36:07,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:09,958 INFO L130 PetriNetUnfolder]: 18776/26046 cut-off events. [2022-12-12 21:36:09,958 INFO L131 PetriNetUnfolder]: For 4695/4695 co-relation queries the response was YES. [2022-12-12 21:36:10,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71768 conditions, 26046 events. 18776/26046 cut-off events. For 4695/4695 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 143732 event pairs, 2867 based on Foata normal form. 270/22275 useless extension candidates. Maximal degree in co-relation 71753. Up to 21494 conditions per place. [2022-12-12 21:36:10,155 INFO L137 encePairwiseOnDemand]: 61/72 looper letters, 79 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2022-12-12 21:36:10,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 569 flow [2022-12-12 21:36:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-12-12 21:36:10,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2022-12-12 21:36:10,161 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -25 predicate places. [2022-12-12 21:36:10,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 102 transitions, 569 flow [2022-12-12 21:36:10,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 102 transitions, 569 flow [2022-12-12 21:36:10,282 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 102 transitions, 569 flow [2022-12-12 21:36:10,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:10,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:10,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:10,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:36:10,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash -759910216, now seen corresponding path program 1 times [2022-12-12 21:36:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:10,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290285329] [2022-12-12 21:36:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:11,391 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 21:36:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:11,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290285329] [2022-12-12 21:36:11,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290285329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:11,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:11,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:36:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438209118] [2022-12-12 21:36:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:11,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:11,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:11,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:11,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 21:36:11,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 102 transitions, 569 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:11,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:11,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 21:36:11,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:13,350 INFO L130 PetriNetUnfolder]: 17667/24427 cut-off events. [2022-12-12 21:36:13,350 INFO L131 PetriNetUnfolder]: For 4465/4465 co-relation queries the response was YES. [2022-12-12 21:36:13,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91227 conditions, 24427 events. 17667/24427 cut-off events. For 4465/4465 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 132497 event pairs, 1277 based on Foata normal form. 300/20867 useless extension candidates. Maximal degree in co-relation 91209. Up to 20123 conditions per place. [2022-12-12 21:36:13,490 INFO L137 encePairwiseOnDemand]: 62/72 looper letters, 119 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2022-12-12 21:36:13,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 1039 flow [2022-12-12 21:36:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-12 21:36:13,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-12 21:36:13,495 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places. [2022-12-12 21:36:13,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 139 transitions, 1039 flow [2022-12-12 21:36:13,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 139 transitions, 1039 flow [2022-12-12 21:36:13,602 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 139 transitions, 1039 flow [2022-12-12 21:36:13,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:13,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:13,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:13,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:36:13,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2082382529, now seen corresponding path program 1 times [2022-12-12 21:36:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:13,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905206366] [2022-12-12 21:36:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:14,001 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 21:36:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:14,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905206366] [2022-12-12 21:36:14,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905206366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:14,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:14,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:36:14,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511117189] [2022-12-12 21:36:14,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:14,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:14,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:14,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:36:14,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 139 transitions, 1039 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:14,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:14,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:36:14,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:15,923 INFO L130 PetriNetUnfolder]: 17487/24167 cut-off events. [2022-12-12 21:36:15,924 INFO L131 PetriNetUnfolder]: For 14696/14696 co-relation queries the response was YES. [2022-12-12 21:36:15,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110219 conditions, 24167 events. 17487/24167 cut-off events. For 14696/14696 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 130589 event pairs, 1008 based on Foata normal form. 50/20377 useless extension candidates. Maximal degree in co-relation 110198. Up to 19893 conditions per place. [2022-12-12 21:36:16,064 INFO L137 encePairwiseOnDemand]: 68/72 looper letters, 139 selfloop transitions, 7 changer transitions 0/168 dead transitions. [2022-12-12 21:36:16,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 168 transitions, 1563 flow [2022-12-12 21:36:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:36:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:36:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-12 21:36:16,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-12 21:36:16,069 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2022-12-12 21:36:16,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 168 transitions, 1563 flow [2022-12-12 21:36:16,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 168 transitions, 1563 flow [2022-12-12 21:36:16,340 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 168 transitions, 1563 flow [2022-12-12 21:36:16,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:16,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:16,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:16,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:36:16,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash -128136568, now seen corresponding path program 1 times [2022-12-12 21:36:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:16,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328588421] [2022-12-12 21:36:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:17,074 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 21:36:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:17,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328588421] [2022-12-12 21:36:17,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328588421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:17,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:17,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:17,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923723071] [2022-12-12 21:36:17,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:17,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:17,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:17,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:17,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:17,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:36:17,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 168 transitions, 1563 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:17,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:17,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:36:17,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:19,695 INFO L130 PetriNetUnfolder]: 22033/30393 cut-off events. [2022-12-12 21:36:19,695 INFO L131 PetriNetUnfolder]: For 45270/45270 co-relation queries the response was YES. [2022-12-12 21:36:19,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162847 conditions, 30393 events. 22033/30393 cut-off events. For 45270/45270 co-relation queries the response was YES. Maximal size of possible extension queue 985. Compared 169873 event pairs, 962 based on Foata normal form. 364/26077 useless extension candidates. Maximal degree in co-relation 162823. Up to 24120 conditions per place. [2022-12-12 21:36:19,868 INFO L137 encePairwiseOnDemand]: 64/72 looper letters, 186 selfloop transitions, 28 changer transitions 0/236 dead transitions. [2022-12-12 21:36:19,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 236 transitions, 2670 flow [2022-12-12 21:36:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-12-12 21:36:19,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2022-12-12 21:36:19,871 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -17 predicate places. [2022-12-12 21:36:19,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 236 transitions, 2670 flow [2022-12-12 21:36:20,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 236 transitions, 2670 flow [2022-12-12 21:36:20,020 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 236 transitions, 2670 flow [2022-12-12 21:36:20,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:20,020 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:20,020 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:36:20,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash -130183498, now seen corresponding path program 2 times [2022-12-12 21:36:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:20,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537552458] [2022-12-12 21:36:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:20,426 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 21:36:20,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:20,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537552458] [2022-12-12 21:36:20,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537552458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:20,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:20,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:36:20,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798084533] [2022-12-12 21:36:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:20,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:20,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:36:20,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 236 transitions, 2670 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 21:36:20,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:20,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:36:20,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:23,436 INFO L130 PetriNetUnfolder]: 23054/31767 cut-off events. [2022-12-12 21:36:23,437 INFO L131 PetriNetUnfolder]: For 80759/80759 co-relation queries the response was YES. [2022-12-12 21:36:23,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196557 conditions, 31767 events. 23054/31767 cut-off events. For 80759/80759 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 179173 event pairs, 941 based on Foata normal form. 300/27076 useless extension candidates. Maximal degree in co-relation 196530. Up to 25300 conditions per place. [2022-12-12 21:36:23,658 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 248 selfloop transitions, 29 changer transitions 0/299 dead transitions. [2022-12-12 21:36:23,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 299 transitions, 3983 flow [2022-12-12 21:36:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-12-12 21:36:23,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-12 21:36:23,660 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2022-12-12 21:36:23,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 299 transitions, 3983 flow [2022-12-12 21:36:23,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 299 transitions, 3983 flow [2022-12-12 21:36:23,830 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 299 transitions, 3983 flow [2022-12-12 21:36:23,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 21:36:23,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:23,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:23,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:36:23,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1357351527, now seen corresponding path program 1 times [2022-12-12 21:36:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:23,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709059766] [2022-12-12 21:36:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:23,985 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 21:36:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709059766] [2022-12-12 21:36:23,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709059766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:23,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:23,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937508445] [2022-12-12 21:36:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:23,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:23,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:23,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:36:23,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 299 transitions, 3983 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:23,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:23,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:36:23,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:29,685 INFO L130 PetriNetUnfolder]: 44514/60987 cut-off events. [2022-12-12 21:36:29,685 INFO L131 PetriNetUnfolder]: For 324958/327451 co-relation queries the response was YES. [2022-12-12 21:36:29,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407185 conditions, 60987 events. 44514/60987 cut-off events. For 324958/327451 co-relation queries the response was YES. Maximal size of possible extension queue 2428. Compared 381401 event pairs, 3533 based on Foata normal form. 4334/56370 useless extension candidates. Maximal degree in co-relation 407155. Up to 45917 conditions per place. [2022-12-12 21:36:30,246 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 371 selfloop transitions, 93 changer transitions 360/858 dead transitions. [2022-12-12 21:36:30,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 858 transitions, 13355 flow [2022-12-12 21:36:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:36:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:36:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-12-12 21:36:30,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2022-12-12 21:36:30,253 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2022-12-12 21:36:30,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 858 transitions, 13355 flow [2022-12-12 21:36:30,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 498 transitions, 7691 flow [2022-12-12 21:36:30,546 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 498 transitions, 7691 flow [2022-12-12 21:36:30,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:30,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:30,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:30,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:36:30,546 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:30,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1283284507, now seen corresponding path program 1 times [2022-12-12 21:36:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:30,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152441829] [2022-12-12 21:36:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:30,719 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 21:36:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:30,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152441829] [2022-12-12 21:36:30,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152441829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:30,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:30,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:36:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654829168] [2022-12-12 21:36:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:30,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:30,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:36:30,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 498 transitions, 7691 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:30,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:30,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:36:30,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:35,608 INFO L130 PetriNetUnfolder]: 30058/42888 cut-off events. [2022-12-12 21:36:35,609 INFO L131 PetriNetUnfolder]: For 275471/280092 co-relation queries the response was YES. [2022-12-12 21:36:35,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323220 conditions, 42888 events. 30058/42888 cut-off events. For 275471/280092 co-relation queries the response was YES. Maximal size of possible extension queue 1832. Compared 281420 event pairs, 1595 based on Foata normal form. 4928/41907 useless extension candidates. Maximal degree in co-relation 323187. Up to 35004 conditions per place. [2022-12-12 21:36:35,941 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 382 selfloop transitions, 175 changer transitions 271/859 dead transitions. [2022-12-12 21:36:35,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 859 transitions, 15015 flow [2022-12-12 21:36:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:36:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:36:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2022-12-12 21:36:35,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42824074074074076 [2022-12-12 21:36:35,944 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2022-12-12 21:36:35,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 859 transitions, 15015 flow [2022-12-12 21:36:36,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 588 transitions, 10233 flow [2022-12-12 21:36:36,268 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 588 transitions, 10233 flow [2022-12-12 21:36:36,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:36,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:36,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:36,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:36:36,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 585677138, now seen corresponding path program 1 times [2022-12-12 21:36:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:36,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028116961] [2022-12-12 21:36:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:36,427 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 21:36:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:36,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028116961] [2022-12-12 21:36:36,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028116961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:36,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:36:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46317359] [2022-12-12 21:36:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:36,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:36:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:36:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:36:36,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:36:36,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 588 transitions, 10233 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:36,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:36,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:36:36,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:39,654 INFO L130 PetriNetUnfolder]: 16617/24728 cut-off events. [2022-12-12 21:36:39,654 INFO L131 PetriNetUnfolder]: For 195495/200145 co-relation queries the response was YES. [2022-12-12 21:36:39,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208170 conditions, 24728 events. 16617/24728 cut-off events. For 195495/200145 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 161391 event pairs, 392 based on Foata normal form. 3969/25225 useless extension candidates. Maximal degree in co-relation 208134. Up to 19851 conditions per place. [2022-12-12 21:36:39,803 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 323 selfloop transitions, 217 changer transitions 126/695 dead transitions. [2022-12-12 21:36:39,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 695 transitions, 13362 flow [2022-12-12 21:36:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:36:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:36:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2022-12-12 21:36:39,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-12 21:36:39,805 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2022-12-12 21:36:39,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 695 transitions, 13362 flow [2022-12-12 21:36:39,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 569 transitions, 10938 flow [2022-12-12 21:36:39,920 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 569 transitions, 10938 flow [2022-12-12 21:36:39,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:39,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:39,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:39,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:36:39,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash -586063783, now seen corresponding path program 1 times [2022-12-12 21:36:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:39,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574411403] [2022-12-12 21:36:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:40,864 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 21:36:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:40,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574411403] [2022-12-12 21:36:40,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574411403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:40,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:40,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:36:40,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143640903] [2022-12-12 21:36:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:40,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:36:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:36:40,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:36:40,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 21:36:40,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 569 transitions, 10938 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:40,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:40,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 21:36:40,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:44,696 INFO L130 PetriNetUnfolder]: 18506/27762 cut-off events. [2022-12-12 21:36:44,696 INFO L131 PetriNetUnfolder]: For 205164/209163 co-relation queries the response was YES. [2022-12-12 21:36:44,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258428 conditions, 27762 events. 18506/27762 cut-off events. For 205164/209163 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 186251 event pairs, 576 based on Foata normal form. 1018/24297 useless extension candidates. Maximal degree in co-relation 258389. Up to 22608 conditions per place. [2022-12-12 21:36:44,865 INFO L137 encePairwiseOnDemand]: 59/72 looper letters, 762 selfloop transitions, 152 changer transitions 142/1078 dead transitions. [2022-12-12 21:36:44,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 1078 transitions, 23021 flow [2022-12-12 21:36:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:36:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:36:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2022-12-12 21:36:44,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2022-12-12 21:36:44,867 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 0 predicate places. [2022-12-12 21:36:44,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 1078 transitions, 23021 flow [2022-12-12 21:36:44,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 936 transitions, 19905 flow [2022-12-12 21:36:44,988 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 936 transitions, 19905 flow [2022-12-12 21:36:44,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:44,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:44,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:44,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:36:44,988 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1880133549, now seen corresponding path program 2 times [2022-12-12 21:36:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:44,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175681215] [2022-12-12 21:36:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:45,174 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 21:36:45,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:45,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175681215] [2022-12-12 21:36:45,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175681215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:45,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:45,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:36:45,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147373464] [2022-12-12 21:36:45,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:45,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:36:45,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:45,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:36:45,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:36:45,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 72 [2022-12-12 21:36:45,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 936 transitions, 19905 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:45,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:45,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 72 [2022-12-12 21:36:45,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:48,328 INFO L130 PetriNetUnfolder]: 11837/17709 cut-off events. [2022-12-12 21:36:48,328 INFO L131 PetriNetUnfolder]: For 175796/180176 co-relation queries the response was YES. [2022-12-12 21:36:48,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178963 conditions, 17709 events. 11837/17709 cut-off events. For 175796/180176 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 110755 event pairs, 174 based on Foata normal form. 2280/17094 useless extension candidates. Maximal degree in co-relation 178921. Up to 13806 conditions per place. [2022-12-12 21:36:48,449 INFO L137 encePairwiseOnDemand]: 57/72 looper letters, 269 selfloop transitions, 223 changer transitions 429/953 dead transitions. [2022-12-12 21:36:48,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 953 transitions, 22017 flow [2022-12-12 21:36:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:36:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:36:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2022-12-12 21:36:48,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3628472222222222 [2022-12-12 21:36:48,451 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 7 predicate places. [2022-12-12 21:36:48,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 953 transitions, 22017 flow [2022-12-12 21:36:48,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 524 transitions, 11969 flow [2022-12-12 21:36:48,530 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 524 transitions, 11969 flow [2022-12-12 21:36:48,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:48,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:48,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:48,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:36:48,531 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:48,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1728546833, now seen corresponding path program 1 times [2022-12-12 21:36:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:48,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885195908] [2022-12-12 21:36:48,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:48,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:48,710 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 21:36:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:48,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885195908] [2022-12-12 21:36:48,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885195908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:48,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:48,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:36:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822825226] [2022-12-12 21:36:48,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:48,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:36:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:48,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:36:48,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:36:48,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:36:48,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 524 transitions, 11969 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:48,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:48,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:36:48,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:50,721 INFO L130 PetriNetUnfolder]: 9642/14389 cut-off events. [2022-12-12 21:36:50,721 INFO L131 PetriNetUnfolder]: For 150716/152755 co-relation queries the response was YES. [2022-12-12 21:36:50,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156980 conditions, 14389 events. 9642/14389 cut-off events. For 150716/152755 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 89502 event pairs, 98 based on Foata normal form. 358/11891 useless extension candidates. Maximal degree in co-relation 156935. Up to 12040 conditions per place. [2022-12-12 21:36:50,797 INFO L137 encePairwiseOnDemand]: 69/72 looper letters, 347 selfloop transitions, 16 changer transitions 470/866 dead transitions. [2022-12-12 21:36:50,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 866 transitions, 21803 flow [2022-12-12 21:36:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:36:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:36:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-12 21:36:50,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-12 21:36:50,800 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 7 predicate places. [2022-12-12 21:36:50,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 866 transitions, 21803 flow [2022-12-12 21:36:50,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 396 transitions, 9732 flow [2022-12-12 21:36:50,857 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 396 transitions, 9732 flow [2022-12-12 21:36:50,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:36:50,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:50,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:50,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:36:50,857 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:50,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:50,858 INFO L85 PathProgramCache]: Analyzing trace with hash -190277257, now seen corresponding path program 2 times [2022-12-12 21:36:50,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:50,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229780186] [2022-12-12 21:36:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:51,387 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 21:36:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:51,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229780186] [2022-12-12 21:36:51,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229780186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:51,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:51,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:36:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735138845] [2022-12-12 21:36:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:36:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:36:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:36:51,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 72 [2022-12-12 21:36:51,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 396 transitions, 9732 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 21:36:51,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:51,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 72 [2022-12-12 21:36:51,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:52,858 INFO L130 PetriNetUnfolder]: 6118/9607 cut-off events. [2022-12-12 21:36:52,859 INFO L131 PetriNetUnfolder]: For 92785/93813 co-relation queries the response was YES. [2022-12-12 21:36:52,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112969 conditions, 9607 events. 6118/9607 cut-off events. For 92785/93813 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 61887 event pairs, 21 based on Foata normal form. 237/7746 useless extension candidates. Maximal degree in co-relation 112921. Up to 8539 conditions per place. [2022-12-12 21:36:52,918 INFO L137 encePairwiseOnDemand]: 65/72 looper letters, 356 selfloop transitions, 113 changer transitions 48/547 dead transitions. [2022-12-12 21:36:52,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 547 transitions, 14692 flow [2022-12-12 21:36:52,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:36:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:36:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2022-12-12 21:36:52,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2022-12-12 21:36:52,920 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2022-12-12 21:36:52,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 547 transitions, 14692 flow [2022-12-12 21:36:52,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 499 transitions, 13348 flow [2022-12-12 21:36:52,972 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 499 transitions, 13348 flow [2022-12-12 21:36:52,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 21:36:52,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:52,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:52,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:36:52,973 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1728425183, now seen corresponding path program 1 times [2022-12-12 21:36:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:52,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001378511] [2022-12-12 21:36:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:52,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:36:54,315 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 21:36:54,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:36:54,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001378511] [2022-12-12 21:36:54,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001378511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:36:54,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:36:54,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:36:54,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087574310] [2022-12-12 21:36:54,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:36:54,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:36:54,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:36:54,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:36:54,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:36:54,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 72 [2022-12-12 21:36:54,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 499 transitions, 13348 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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 21:36:54,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:36:54,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 72 [2022-12-12 21:36:54,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:36:56,199 INFO L130 PetriNetUnfolder]: 6398/10260 cut-off events. [2022-12-12 21:36:56,200 INFO L131 PetriNetUnfolder]: For 93597/95036 co-relation queries the response was YES. [2022-12-12 21:36:56,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126916 conditions, 10260 events. 6398/10260 cut-off events. For 93597/95036 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 68825 event pairs, 10 based on Foata normal form. 281/8267 useless extension candidates. Maximal degree in co-relation 126865. Up to 9195 conditions per place. [2022-12-12 21:36:56,264 INFO L137 encePairwiseOnDemand]: 65/72 looper letters, 377 selfloop transitions, 89 changer transitions 74/560 dead transitions. [2022-12-12 21:36:56,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 560 transitions, 15988 flow [2022-12-12 21:36:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:36:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:36:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2022-12-12 21:36:56,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3115079365079365 [2022-12-12 21:36:56,267 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2022-12-12 21:36:56,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 560 transitions, 15988 flow [2022-12-12 21:36:56,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 486 transitions, 13832 flow [2022-12-12 21:36:56,313 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 486 transitions, 13832 flow [2022-12-12 21:36:56,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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 21:36:56,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:36:56,314 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:56,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:36:56,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:36:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:36:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 467395137, now seen corresponding path program 3 times [2022-12-12 21:36:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:36:56,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579522265] [2022-12-12 21:36:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:36:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:36:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:36:56,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:36:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:36:56,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:36:56,411 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:36:56,412 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 21:36:56,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 21:36:56,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 21:36:56,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 21:36:56,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 21:36:56,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 21:36:56,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 21:36:56,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 21:36:56,421 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:36:56,426 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:36:56,426 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:36:56,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:36:56 BasicIcfg [2022-12-12 21:36:56,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:36:56,529 INFO L158 Benchmark]: Toolchain (without parser) took 69034.00ms. Allocated memory was 212.9MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 187.8MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-12 21:36:56,529 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 212.9MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:36:56,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.08ms. Allocated memory is still 212.9MB. Free memory was 187.8MB in the beginning and 159.8MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 21:36:56,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.86ms. Allocated memory is still 212.9MB. Free memory was 159.8MB in the beginning and 157.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:36:56,529 INFO L158 Benchmark]: Boogie Preprocessor took 38.19ms. Allocated memory is still 212.9MB. Free memory was 157.2MB in the beginning and 155.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:36:56,530 INFO L158 Benchmark]: RCFGBuilder took 710.08ms. Allocated memory is still 212.9MB. Free memory was 155.1MB in the beginning and 119.0MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-12 21:36:56,530 INFO L158 Benchmark]: TraceAbstraction took 67710.70ms. Allocated memory was 212.9MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 117.4MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-12 21:36:56,531 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.13ms. Allocated memory is still 212.9MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.08ms. Allocated memory is still 212.9MB. Free memory was 187.8MB in the beginning and 159.8MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.86ms. Allocated memory is still 212.9MB. Free memory was 159.8MB in the beginning and 157.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.19ms. Allocated memory is still 212.9MB. Free memory was 157.2MB in the beginning and 155.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 710.08ms. Allocated memory is still 212.9MB. Free memory was 155.1MB in the beginning and 119.0MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 67710.70ms. Allocated memory was 212.9MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 117.4MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9s, 136 PlacesBefore, 84 PlacesAfterwards, 125 TransitionsBefore, 72 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 4499, independent unconditional: 0, dependent: 153, dependent conditional: 153, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 0, independent unconditional: 4499, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 0, independent unconditional: 4499, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4652, independent: 4499, independent conditional: 0, independent unconditional: 4499, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2663, independent: 2611, independent conditional: 0, independent unconditional: 2611, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2663, independent: 2558, independent conditional: 0, independent unconditional: 2558, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 274, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4652, independent: 1888, independent conditional: 0, independent unconditional: 1888, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 2663, unknown conditional: 0, unknown unconditional: 2663] , Statistics on independence cache: Total cache size (in pairs): 4539, Positive cache size: 4487, Positive conditional cache size: 0, Positive unconditional cache size: 4487, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-3, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-2, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 2.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 67.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1797 IncrementalHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 36 mSDtfsCounter, 1797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19905occurred in iteration=10, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 41829 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 2534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:36:56,551 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...