/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:04:35,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:04:35,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:04:35,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:04:35,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:04:35,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:04:35,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:04:35,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:04:35,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:04:35,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:04:35,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:04:35,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:04:35,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:04:35,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:04:35,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:04:35,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:04:35,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:04:35,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:04:35,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:04:35,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:04:35,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:04:35,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:04:35,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:04:35,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:04:35,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:04:35,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:04:35,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:04:35,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:04:35,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:04:35,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:04:35,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:04:35,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:04:35,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:04:35,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:04:35,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:04:35,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:04:35,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:04:35,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:04:35,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:04:35,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:04:35,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:04:35,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 21:04:35,735 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:04:35,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:04:35,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:04:35,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:04:35,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:04:35,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:04:35,738 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:04:35,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:04:35,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:04:35,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:04:35,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:04:35,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:35,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:04:35,740 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:04:35,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:04:35,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:04:35,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:04:35,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 21:04:36,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:04:36,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:04:36,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:04:36,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:04:36,055 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:04:36,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:04:37,100 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:04:37,307 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:04:37,307 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:04:37,320 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697789b9e/45223f4490e54fa0bd332e498bbab39e/FLAGafeec5233 [2022-12-11 21:04:37,331 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697789b9e/45223f4490e54fa0bd332e498bbab39e [2022-12-11 21:04:37,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:04:37,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:04:37,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:37,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:04:37,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:04:37,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a27833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37, skipping insertion in model container [2022-12-11 21:04:37,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:04:37,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:04:37,507 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-11 21:04:37,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:37,702 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:04:37,717 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-11 21:04:37,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:37,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:37,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:37,802 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:04:37,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37 WrapperNode [2022-12-11 21:04:37,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:37,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:37,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:04:37,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:04:37,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,853 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-11 21:04:37,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:37,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:04:37,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:04:37,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:04:37,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,884 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:04:37,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:04:37,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:04:37,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:04:37,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (1/1) ... [2022-12-11 21:04:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:37,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:04:37,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 21:04:37,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 21:04:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:04:37,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:04:37,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:04:37,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:04:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:04:37,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:04:37,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:04:37,950 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:04:38,042 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:04:38,044 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:04:38,366 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:04:38,449 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:04:38,449 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:04:38,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:38 BoogieIcfgContainer [2022-12-11 21:04:38,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:04:38,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:04:38,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:04:38,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:04:38,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:04:37" (1/3) ... [2022-12-11 21:04:38,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ea1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:38, skipping insertion in model container [2022-12-11 21:04:38,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:37" (2/3) ... [2022-12-11 21:04:38,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ea1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:38, skipping insertion in model container [2022-12-11 21:04:38,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:38" (3/3) ... [2022-12-11 21:04:38,459 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:04:38,477 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:04:38,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:04:38,478 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:04:38,529 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:04:38,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 21:04:38,603 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-11 21:04:38,603 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:38,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-11 21:04:38,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 21:04:38,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-11 21:04:38,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:04:38,626 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;@72eabff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:04:38,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 21:04:38,633 INFO L130 PetriNetUnfolder]: 0/40 cut-off events. [2022-12-11 21:04:38,634 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:38,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:38,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:38,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2060284455, now seen corresponding path program 1 times [2022-12-11 21:04:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:38,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929585044] [2022-12-11 21:04:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:39,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929585044] [2022-12-11 21:04:39,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929585044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:39,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:39,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:04:39,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332928039] [2022-12-11 21:04:39,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:39,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:04:39,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:39,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:04:39,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:04:39,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2022-12-11 21:04:39,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:39,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:39,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2022-12-11 21:04:39,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:39,332 INFO L130 PetriNetUnfolder]: 58/445 cut-off events. [2022-12-11 21:04:39,332 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 21:04:39,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 445 events. 58/445 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2286 event pairs, 44 based on Foata normal form. 17/432 useless extension candidates. Maximal degree in co-relation 527. Up to 79 conditions per place. [2022-12-11 21:04:39,339 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 14 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-11 21:04:39,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:04:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:04:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-12-11 21:04:39,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9339622641509434 [2022-12-11 21:04:39,358 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-11 21:04:39,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:39,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:39,363 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 257 flow [2022-12-11 21:04:39,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:39,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:39,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:39,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:04:39,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1106117656, now seen corresponding path program 1 times [2022-12-11 21:04:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:39,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177371038] [2022-12-11 21:04:39,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:40,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177371038] [2022-12-11 21:04:40,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177371038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:40,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:40,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552504838] [2022-12-11 21:04:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:40,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:40,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:40,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-11 21:04:40,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:40,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:40,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-11 21:04:40,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:41,238 INFO L130 PetriNetUnfolder]: 2340/5145 cut-off events. [2022-12-11 21:04:41,239 INFO L131 PetriNetUnfolder]: For 1059/1967 co-relation queries the response was YES. [2022-12-11 21:04:41,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10177 conditions, 5145 events. 2340/5145 cut-off events. For 1059/1967 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 40497 event pairs, 273 based on Foata normal form. 0/5000 useless extension candidates. Maximal degree in co-relation 10118. Up to 1563 conditions per place. [2022-12-11 21:04:41,263 INFO L137 encePairwiseOnDemand]: 91/106 looper letters, 47 selfloop transitions, 16 changer transitions 111/235 dead transitions. [2022-12-11 21:04:41,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 235 transitions, 983 flow [2022-12-11 21:04:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1091 transitions. [2022-12-11 21:04:41,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7917271407837445 [2022-12-11 21:04:41,267 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-11 21:04:41,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 235 transitions, 983 flow [2022-12-11 21:04:41,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 124 transitions, 465 flow [2022-12-11 21:04:41,281 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 465 flow [2022-12-11 21:04:41,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:41,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:41,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:41,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:04:41,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1871307783, now seen corresponding path program 1 times [2022-12-11 21:04:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:41,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661642320] [2022-12-11 21:04:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:42,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:42,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661642320] [2022-12-11 21:04:42,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661642320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:42,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:42,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 21:04:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037881330] [2022-12-11 21:04:42,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:42,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:04:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:42,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:04:42,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-11 21:04:42,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-11 21:04:42,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 465 flow. Second operand has 10 states, 10 states have (on average 75.0) internal successors, (750), 10 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:42,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:42,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-11 21:04:42,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:43,281 INFO L130 PetriNetUnfolder]: 1861/3426 cut-off events. [2022-12-11 21:04:43,281 INFO L131 PetriNetUnfolder]: For 1058/3024 co-relation queries the response was YES. [2022-12-11 21:04:43,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10384 conditions, 3426 events. 1861/3426 cut-off events. For 1058/3024 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21582 event pairs, 141 based on Foata normal form. 139/3489 useless extension candidates. Maximal degree in co-relation 10313. Up to 2079 conditions per place. [2022-12-11 21:04:43,299 INFO L137 encePairwiseOnDemand]: 86/106 looper letters, 68 selfloop transitions, 54 changer transitions 173/356 dead transitions. [2022-12-11 21:04:43,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 356 transitions, 2199 flow [2022-12-11 21:04:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 21:04:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 21:04:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1888 transitions. [2022-12-11 21:04:43,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7744052502050861 [2022-12-11 21:04:43,328 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2022-12-11 21:04:43,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 356 transitions, 2199 flow [2022-12-11 21:04:43,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 183 transitions, 1019 flow [2022-12-11 21:04:43,340 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 183 transitions, 1019 flow [2022-12-11 21:04:43,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 10 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:43,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:43,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:43,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:04:43,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash -842997401, now seen corresponding path program 1 times [2022-12-11 21:04:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:43,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263694207] [2022-12-11 21:04:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:43,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:43,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263694207] [2022-12-11 21:04:43,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263694207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:43,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:43,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479246719] [2022-12-11 21:04:43,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:43,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:43,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:43,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:43,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-11 21:04:43,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 183 transitions, 1019 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:43,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:43,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-11 21:04:43,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:44,372 INFO L130 PetriNetUnfolder]: 1535/2880 cut-off events. [2022-12-11 21:04:44,372 INFO L131 PetriNetUnfolder]: For 1475/7673 co-relation queries the response was YES. [2022-12-11 21:04:44,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11067 conditions, 2880 events. 1535/2880 cut-off events. For 1475/7673 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17500 event pairs, 144 based on Foata normal form. 148/2964 useless extension candidates. Maximal degree in co-relation 10984. Up to 1696 conditions per place. [2022-12-11 21:04:44,386 INFO L137 encePairwiseOnDemand]: 92/106 looper letters, 102 selfloop transitions, 49 changer transitions 90/302 dead transitions. [2022-12-11 21:04:44,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 302 transitions, 2349 flow [2022-12-11 21:04:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1078 transitions. [2022-12-11 21:04:44,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7822931785195936 [2022-12-11 21:04:44,389 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-11 21:04:44,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 302 transitions, 2349 flow [2022-12-11 21:04:44,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 212 transitions, 1533 flow [2022-12-11 21:04:44,399 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 212 transitions, 1533 flow [2022-12-11 21:04:44,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:44,400 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:44,400 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:44,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:04:44,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1889475203, now seen corresponding path program 1 times [2022-12-11 21:04:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:44,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772353547] [2022-12-11 21:04:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772353547] [2022-12-11 21:04:44,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772353547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:44,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:44,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:44,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72559244] [2022-12-11 21:04:44,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:44,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:44,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:44,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:44,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:44,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-11 21:04:44,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 212 transitions, 1533 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:44,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:44,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-11 21:04:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:45,549 INFO L130 PetriNetUnfolder]: 1740/3308 cut-off events. [2022-12-11 21:04:45,550 INFO L131 PetriNetUnfolder]: For 3096/14957 co-relation queries the response was YES. [2022-12-11 21:04:45,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15579 conditions, 3308 events. 1740/3308 cut-off events. For 3096/14957 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20992 event pairs, 159 based on Foata normal form. 201/3421 useless extension candidates. Maximal degree in co-relation 15484. Up to 2095 conditions per place. [2022-12-11 21:04:45,567 INFO L137 encePairwiseOnDemand]: 91/106 looper letters, 136 selfloop transitions, 39 changer transitions 89/325 dead transitions. [2022-12-11 21:04:45,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 325 transitions, 3093 flow [2022-12-11 21:04:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1065 transitions. [2022-12-11 21:04:45,570 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7728592162554426 [2022-12-11 21:04:45,571 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2022-12-11 21:04:45,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 325 transitions, 3093 flow [2022-12-11 21:04:45,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 236 transitions, 2108 flow [2022-12-11 21:04:45,585 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 236 transitions, 2108 flow [2022-12-11 21:04:45,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:45,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:45,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:45,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:04:45,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1727041470, now seen corresponding path program 1 times [2022-12-11 21:04:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:45,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843833533] [2022-12-11 21:04:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:45,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843833533] [2022-12-11 21:04:45,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843833533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:45,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:45,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185878275] [2022-12-11 21:04:45,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:45,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:45,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:45,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-11 21:04:45,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 236 transitions, 2108 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:45,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:45,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-11 21:04:45,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:46,847 INFO L130 PetriNetUnfolder]: 2011/4304 cut-off events. [2022-12-11 21:04:46,848 INFO L131 PetriNetUnfolder]: For 5130/47090 co-relation queries the response was YES. [2022-12-11 21:04:46,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22277 conditions, 4304 events. 2011/4304 cut-off events. For 5130/47090 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 33152 event pairs, 92 based on Foata normal form. 198/4412 useless extension candidates. Maximal degree in co-relation 22170. Up to 2606 conditions per place. [2022-12-11 21:04:46,870 INFO L137 encePairwiseOnDemand]: 92/106 looper letters, 167 selfloop transitions, 34 changer transitions 134/396 dead transitions. [2022-12-11 21:04:46,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 396 transitions, 4560 flow [2022-12-11 21:04:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1065 transitions. [2022-12-11 21:04:46,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7728592162554426 [2022-12-11 21:04:46,875 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2022-12-11 21:04:46,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 396 transitions, 4560 flow [2022-12-11 21:04:46,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 262 transitions, 2804 flow [2022-12-11 21:04:46,892 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 262 transitions, 2804 flow [2022-12-11 21:04:46,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:46,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:46,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:46,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:04:46,892 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash -125156792, now seen corresponding path program 1 times [2022-12-11 21:04:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:46,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97717515] [2022-12-11 21:04:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:47,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97717515] [2022-12-11 21:04:47,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97717515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:47,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:47,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:04:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288373986] [2022-12-11 21:04:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:47,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:04:47,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:47,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:04:47,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:04:47,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 21:04:47,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 262 transitions, 2804 flow. Second operand has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:47,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:47,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 21:04:47,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:47,896 INFO L130 PetriNetUnfolder]: 1620/3873 cut-off events. [2022-12-11 21:04:47,896 INFO L131 PetriNetUnfolder]: For 8674/59897 co-relation queries the response was YES. [2022-12-11 21:04:47,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20887 conditions, 3873 events. 1620/3873 cut-off events. For 8674/59897 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 31877 event pairs, 88 based on Foata normal form. 132/3951 useless extension candidates. Maximal degree in co-relation 20774. Up to 2044 conditions per place. [2022-12-11 21:04:47,916 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 143 selfloop transitions, 24 changer transitions 138/414 dead transitions. [2022-12-11 21:04:47,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 414 transitions, 5446 flow [2022-12-11 21:04:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:04:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:04:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1235 transitions. [2022-12-11 21:04:47,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8322102425876011 [2022-12-11 21:04:47,919 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 22 predicate places. [2022-12-11 21:04:47,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 414 transitions, 5446 flow [2022-12-11 21:04:47,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 276 transitions, 3310 flow [2022-12-11 21:04:47,936 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 276 transitions, 3310 flow [2022-12-11 21:04:47,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.55555555555556) internal successors, (761), 9 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:47,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:47,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:47,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:04:47,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash 60139366, now seen corresponding path program 1 times [2022-12-11 21:04:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:47,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536284508] [2022-12-11 21:04:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:48,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536284508] [2022-12-11 21:04:48,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536284508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:48,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:48,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 21:04:48,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659837636] [2022-12-11 21:04:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:48,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 21:04:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 21:04:48,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-11 21:04:48,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 21:04:48,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 276 transitions, 3310 flow. Second operand has 11 states, 11 states have (on average 81.54545454545455) internal successors, (897), 11 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:48,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:48,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 21:04:48,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:49,267 INFO L130 PetriNetUnfolder]: 1853/4604 cut-off events. [2022-12-11 21:04:49,267 INFO L131 PetriNetUnfolder]: For 14382/84555 co-relation queries the response was YES. [2022-12-11 21:04:49,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26545 conditions, 4604 events. 1853/4604 cut-off events. For 14382/84555 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 41061 event pairs, 109 based on Foata normal form. 200/4733 useless extension candidates. Maximal degree in co-relation 26423. Up to 2450 conditions per place. [2022-12-11 21:04:49,291 INFO L137 encePairwiseOnDemand]: 93/106 looper letters, 161 selfloop transitions, 46 changer transitions 159/472 dead transitions. [2022-12-11 21:04:49,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 472 transitions, 7027 flow [2022-12-11 21:04:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1103 transitions. [2022-12-11 21:04:49,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8004354136429608 [2022-12-11 21:04:49,296 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2022-12-11 21:04:49,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 472 transitions, 7027 flow [2022-12-11 21:04:49,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 313 transitions, 4301 flow [2022-12-11 21:04:49,314 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 313 transitions, 4301 flow [2022-12-11 21:04:49,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.54545454545455) internal successors, (897), 11 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:49,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:49,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:49,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:04:49,315 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1467753004, now seen corresponding path program 2 times [2022-12-11 21:04:49,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:49,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695784715] [2022-12-11 21:04:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695784715] [2022-12-11 21:04:49,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695784715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:49,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:49,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 21:04:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767628669] [2022-12-11 21:04:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:49,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:04:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:04:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 21:04:49,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-11 21:04:49,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 313 transitions, 4301 flow. Second operand has 10 states, 10 states have (on average 82.6) internal successors, (826), 10 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:49,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:49,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-11 21:04:49,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:50,414 INFO L130 PetriNetUnfolder]: 1637/4128 cut-off events. [2022-12-11 21:04:50,414 INFO L131 PetriNetUnfolder]: For 15604/58986 co-relation queries the response was YES. [2022-12-11 21:04:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26155 conditions, 4128 events. 1637/4128 cut-off events. For 15604/58986 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 36270 event pairs, 104 based on Foata normal form. 283/4350 useless extension candidates. Maximal degree in co-relation 26025. Up to 2239 conditions per place. [2022-12-11 21:04:50,441 INFO L137 encePairwiseOnDemand]: 93/106 looper letters, 142 selfloop transitions, 62 changer transitions 160/471 dead transitions. [2022-12-11 21:04:50,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 471 transitions, 7737 flow [2022-12-11 21:04:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2022-12-11 21:04:50,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.809143686502177 [2022-12-11 21:04:50,444 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 31 predicate places. [2022-12-11 21:04:50,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 471 transitions, 7737 flow [2022-12-11 21:04:50,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 311 transitions, 4675 flow [2022-12-11 21:04:50,463 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 311 transitions, 4675 flow [2022-12-11 21:04:50,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 82.6) internal successors, (826), 10 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:50,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:50,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:50,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 21:04:50,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:50,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1745964217, now seen corresponding path program 1 times [2022-12-11 21:04:50,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:50,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052456757] [2022-12-11 21:04:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:50,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:50,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052456757] [2022-12-11 21:04:50,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052456757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:50,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:50,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 21:04:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11534258] [2022-12-11 21:04:50,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:50,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 21:04:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 21:04:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-11 21:04:50,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-11 21:04:50,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 311 transitions, 4675 flow. Second operand has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:50,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:50,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-11 21:04:50,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:51,478 INFO L130 PetriNetUnfolder]: 1107/2881 cut-off events. [2022-12-11 21:04:51,479 INFO L131 PetriNetUnfolder]: For 18908/43462 co-relation queries the response was YES. [2022-12-11 21:04:51,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19765 conditions, 2881 events. 1107/2881 cut-off events. For 18908/43462 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22934 event pairs, 84 based on Foata normal form. 130/2942 useless extension candidates. Maximal degree in co-relation 19627. Up to 1508 conditions per place. [2022-12-11 21:04:51,495 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 163 selfloop transitions, 25 changer transitions 94/389 dead transitions. [2022-12-11 21:04:51,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 389 transitions, 6763 flow [2022-12-11 21:04:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1109 transitions. [2022-12-11 21:04:51,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8047895500725689 [2022-12-11 21:04:51,498 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 37 predicate places. [2022-12-11 21:04:51,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 389 transitions, 6763 flow [2022-12-11 21:04:51,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 295 transitions, 4755 flow [2022-12-11 21:04:51,511 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 295 transitions, 4755 flow [2022-12-11 21:04:51,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:51,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:51,512 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:51,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 21:04:51,512 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -810709112, now seen corresponding path program 1 times [2022-12-11 21:04:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:51,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000615149] [2022-12-11 21:04:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:52,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:52,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000615149] [2022-12-11 21:04:52,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000615149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:52,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:52,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 21:04:52,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663541087] [2022-12-11 21:04:52,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:52,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:04:52,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:52,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:04:52,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-11 21:04:52,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-11 21:04:52,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 295 transitions, 4755 flow. Second operand has 10 states, 10 states have (on average 75.3) internal successors, (753), 10 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:52,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:52,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-11 21:04:52,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:53,310 INFO L130 PetriNetUnfolder]: 1544/3866 cut-off events. [2022-12-11 21:04:53,310 INFO L131 PetriNetUnfolder]: For 26989/98604 co-relation queries the response was YES. [2022-12-11 21:04:53,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29816 conditions, 3866 events. 1544/3866 cut-off events. For 26989/98604 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 32145 event pairs, 36 based on Foata normal form. 435/4240 useless extension candidates. Maximal degree in co-relation 29666. Up to 2120 conditions per place. [2022-12-11 21:04:53,336 INFO L137 encePairwiseOnDemand]: 90/106 looper letters, 180 selfloop transitions, 107 changer transitions 185/533 dead transitions. [2022-12-11 21:04:53,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 533 transitions, 10333 flow [2022-12-11 21:04:53,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 21:04:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 21:04:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1367 transitions. [2022-12-11 21:04:53,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7586015538290788 [2022-12-11 21:04:53,339 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 47 predicate places. [2022-12-11 21:04:53,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 533 transitions, 10333 flow [2022-12-11 21:04:53,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 348 transitions, 6333 flow [2022-12-11 21:04:53,413 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 348 transitions, 6333 flow [2022-12-11 21:04:53,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.3) internal successors, (753), 10 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:53,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:53,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:53,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 21:04:53,414 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash -714011554, now seen corresponding path program 2 times [2022-12-11 21:04:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:53,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769136055] [2022-12-11 21:04:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:53,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769136055] [2022-12-11 21:04:53,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769136055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:53,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:53,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:04:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175787372] [2022-12-11 21:04:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:53,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:04:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:04:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:04:53,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 21:04:53,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 348 transitions, 6333 flow. Second operand has 9 states, 9 states have (on average 84.66666666666667) internal successors, (762), 9 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:53,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:53,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 21:04:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:54,446 INFO L130 PetriNetUnfolder]: 1478/3710 cut-off events. [2022-12-11 21:04:54,447 INFO L131 PetriNetUnfolder]: For 29551/67329 co-relation queries the response was YES. [2022-12-11 21:04:54,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30752 conditions, 3710 events. 1478/3710 cut-off events. For 29551/67329 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30990 event pairs, 37 based on Foata normal form. 246/3911 useless extension candidates. Maximal degree in co-relation 30596. Up to 2027 conditions per place. [2022-12-11 21:04:54,472 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 190 selfloop transitions, 57 changer transitions 145/513 dead transitions. [2022-12-11 21:04:54,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 513 transitions, 11011 flow [2022-12-11 21:04:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:04:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:04:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 971 transitions. [2022-12-11 21:04:54,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8327615780445969 [2022-12-11 21:04:54,474 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 48 predicate places. [2022-12-11 21:04:54,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 513 transitions, 11011 flow [2022-12-11 21:04:54,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 368 transitions, 7307 flow [2022-12-11 21:04:54,494 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 368 transitions, 7307 flow [2022-12-11 21:04:54,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.66666666666667) internal successors, (762), 9 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:54,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:54,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:54,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 21:04:54,494 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:54,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1217659128, now seen corresponding path program 3 times [2022-12-11 21:04:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:54,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593383665] [2022-12-11 21:04:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:54,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:54,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593383665] [2022-12-11 21:04:54,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593383665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:54,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:54,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 21:04:54,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482231885] [2022-12-11 21:04:54,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:54,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 21:04:54,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:54,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 21:04:54,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-11 21:04:54,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-11 21:04:54,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 368 transitions, 7307 flow. Second operand has 11 states, 11 states have (on average 82.54545454545455) internal successors, (908), 11 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:54,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:54,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-11 21:04:54,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:55,592 INFO L130 PetriNetUnfolder]: 1294/3234 cut-off events. [2022-12-11 21:04:55,593 INFO L131 PetriNetUnfolder]: For 40420/138537 co-relation queries the response was YES. [2022-12-11 21:04:55,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29337 conditions, 3234 events. 1294/3234 cut-off events. For 40420/138537 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 26316 event pairs, 37 based on Foata normal form. 330/3510 useless extension candidates. Maximal degree in co-relation 29173. Up to 1790 conditions per place. [2022-12-11 21:04:55,613 INFO L137 encePairwiseOnDemand]: 93/106 looper letters, 179 selfloop transitions, 74 changer transitions 147/519 dead transitions. [2022-12-11 21:04:55,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 519 transitions, 11967 flow [2022-12-11 21:04:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:04:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:04:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1202 transitions. [2022-12-11 21:04:55,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8099730458221024 [2022-12-11 21:04:55,615 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 55 predicate places. [2022-12-11 21:04:55,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 519 transitions, 11967 flow [2022-12-11 21:04:55,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 372 transitions, 7917 flow [2022-12-11 21:04:55,631 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 372 transitions, 7917 flow [2022-12-11 21:04:55,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.54545454545455) internal successors, (908), 11 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:55,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:55,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 21:04:55,632 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1391623009, now seen corresponding path program 1 times [2022-12-11 21:04:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:55,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313033749] [2022-12-11 21:04:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:55,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313033749] [2022-12-11 21:04:55,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313033749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:55,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:55,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391684603] [2022-12-11 21:04:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:55,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:55,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 21:04:55,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 372 transitions, 7917 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:55,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:55,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 21:04:55,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:57,166 INFO L130 PetriNetUnfolder]: 5226/9660 cut-off events. [2022-12-11 21:04:57,166 INFO L131 PetriNetUnfolder]: For 468276/538106 co-relation queries the response was YES. [2022-12-11 21:04:57,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74954 conditions, 9660 events. 5226/9660 cut-off events. For 468276/538106 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 77742 event pairs, 91 based on Foata normal form. 3100/12447 useless extension candidates. Maximal degree in co-relation 74786. Up to 4264 conditions per place. [2022-12-11 21:04:57,213 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 254 selfloop transitions, 15 changer transitions 247/685 dead transitions. [2022-12-11 21:04:57,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 685 transitions, 17070 flow [2022-12-11 21:04:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:04:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:04:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 902 transitions. [2022-12-11 21:04:57,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8509433962264151 [2022-12-11 21:04:57,215 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 58 predicate places. [2022-12-11 21:04:57,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 685 transitions, 17070 flow [2022-12-11 21:04:57,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 438 transitions, 9790 flow [2022-12-11 21:04:57,246 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 438 transitions, 9790 flow [2022-12-11 21:04:57,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:57,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:57,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:57,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 21:04:57,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 501001697, now seen corresponding path program 1 times [2022-12-11 21:04:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:57,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098650104] [2022-12-11 21:04:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:57,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098650104] [2022-12-11 21:04:57,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098650104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:57,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:57,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:57,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002284936] [2022-12-11 21:04:57,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:57,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:57,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:57,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 21:04:57,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 438 transitions, 9790 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:57,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:57,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 21:04:57,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:58,511 INFO L130 PetriNetUnfolder]: 2444/6008 cut-off events. [2022-12-11 21:04:58,511 INFO L131 PetriNetUnfolder]: For 190685/210888 co-relation queries the response was YES. [2022-12-11 21:04:58,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39151 conditions, 6008 events. 2444/6008 cut-off events. For 190685/210888 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 57125 event pairs, 68 based on Foata normal form. 1331/7230 useless extension candidates. Maximal degree in co-relation 38979. Up to 1797 conditions per place. [2022-12-11 21:04:58,543 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 212 selfloop transitions, 30 changer transitions 253/625 dead transitions. [2022-12-11 21:04:58,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 625 transitions, 15409 flow [2022-12-11 21:04:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1168 transitions. [2022-12-11 21:04:58,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8476052249637155 [2022-12-11 21:04:58,545 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 70 predicate places. [2022-12-11 21:04:58,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 625 transitions, 15409 flow [2022-12-11 21:04:58,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 372 transitions, 8233 flow [2022-12-11 21:04:58,562 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 372 transitions, 8233 flow [2022-12-11 21:04:58,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:58,562 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:58,562 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:58,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 21:04:58,562 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:58,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1818019927, now seen corresponding path program 1 times [2022-12-11 21:04:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:58,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040483217] [2022-12-11 21:04:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:58,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040483217] [2022-12-11 21:04:58,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040483217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:58,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:58,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:04:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135782232] [2022-12-11 21:04:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:58,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:04:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:04:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:04:58,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-11 21:04:58,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 372 transitions, 8233 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:58,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:58,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-11 21:04:58,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:59,488 INFO L130 PetriNetUnfolder]: 1336/4345 cut-off events. [2022-12-11 21:04:59,488 INFO L131 PetriNetUnfolder]: For 91608/102214 co-relation queries the response was YES. [2022-12-11 21:04:59,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27275 conditions, 4345 events. 1336/4345 cut-off events. For 91608/102214 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 45869 event pairs, 51 based on Foata normal form. 534/4813 useless extension candidates. Maximal degree in co-relation 27099. Up to 989 conditions per place. [2022-12-11 21:04:59,508 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 67 selfloop transitions, 20 changer transitions 220/381 dead transitions. [2022-12-11 21:04:59,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 381 transitions, 8689 flow [2022-12-11 21:04:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:04:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:04:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1401 transitions. [2022-12-11 21:04:59,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8260613207547169 [2022-12-11 21:04:59,511 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 85 predicate places. [2022-12-11 21:04:59,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 381 transitions, 8689 flow [2022-12-11 21:04:59,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 161 transitions, 2762 flow [2022-12-11 21:04:59,519 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 161 transitions, 2762 flow [2022-12-11 21:04:59,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:59,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:59,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:59,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 21:04:59,520 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash 237659746, now seen corresponding path program 1 times [2022-12-11 21:04:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:59,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455091833] [2022-12-11 21:04:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:05:00,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:00,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455091833] [2022-12-11 21:05:00,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455091833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:00,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:00,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 21:05:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653307430] [2022-12-11 21:05:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:00,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 21:05:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 21:05:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-12-11 21:05:00,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 106 [2022-12-11 21:05:00,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 161 transitions, 2762 flow. Second operand has 14 states, 14 states have (on average 71.28571428571429) internal successors, (998), 14 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:05:00,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:00,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 106 [2022-12-11 21:05:00,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:01,041 INFO L130 PetriNetUnfolder]: 227/933 cut-off events. [2022-12-11 21:05:01,041 INFO L131 PetriNetUnfolder]: For 14553/15754 co-relation queries the response was YES. [2022-12-11 21:05:01,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6192 conditions, 933 events. 227/933 cut-off events. For 14553/15754 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7232 event pairs, 15 based on Foata normal form. 57/981 useless extension candidates. Maximal degree in co-relation 6000. Up to 218 conditions per place. [2022-12-11 21:05:01,045 INFO L137 encePairwiseOnDemand]: 90/106 looper letters, 53 selfloop transitions, 39 changer transitions 13/183 dead transitions. [2022-12-11 21:05:01,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 183 transitions, 3674 flow [2022-12-11 21:05:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:05:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:05:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1025 transitions. [2022-12-11 21:05:01,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6907008086253369 [2022-12-11 21:05:01,046 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 84 predicate places. [2022-12-11 21:05:01,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 183 transitions, 3674 flow [2022-12-11 21:05:01,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 170 transitions, 3227 flow [2022-12-11 21:05:01,049 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 170 transitions, 3227 flow [2022-12-11 21:05:01,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 71.28571428571429) internal successors, (998), 14 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:05:01,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:01,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:05:01,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 21:05:01,050 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:05:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1900356946, now seen corresponding path program 2 times [2022-12-11 21:05:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:01,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780600708] [2022-12-11 21:05:01,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:05:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:05:01,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:05:01,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780600708] [2022-12-11 21:05:01,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780600708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:05:01,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:05:01,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 21:05:01,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751415524] [2022-12-11 21:05:01,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:05:01,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:05:01,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:05:01,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:05:01,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-11 21:05:01,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 106 [2022-12-11 21:05:01,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 170 transitions, 3227 flow. Second operand has 13 states, 13 states have (on average 72.38461538461539) internal successors, (941), 13 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:05:01,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:05:01,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 106 [2022-12-11 21:05:01,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:05:02,158 INFO L130 PetriNetUnfolder]: 228/1033 cut-off events. [2022-12-11 21:05:02,158 INFO L131 PetriNetUnfolder]: For 16111/17989 co-relation queries the response was YES. [2022-12-11 21:05:02,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6419 conditions, 1033 events. 228/1033 cut-off events. For 16111/17989 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8543 event pairs, 16 based on Foata normal form. 54/1079 useless extension candidates. Maximal degree in co-relation 6212. Up to 221 conditions per place. [2022-12-11 21:05:02,162 INFO L137 encePairwiseOnDemand]: 92/106 looper letters, 42 selfloop transitions, 21 changer transitions 49/180 dead transitions. [2022-12-11 21:05:02,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 180 transitions, 3765 flow [2022-12-11 21:05:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:05:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:05:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 818 transitions. [2022-12-11 21:05:02,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7015437392795884 [2022-12-11 21:05:02,164 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 91 predicate places. [2022-12-11 21:05:02,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 180 transitions, 3765 flow [2022-12-11 21:05:02,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 131 transitions, 2315 flow [2022-12-11 21:05:02,168 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 131 transitions, 2315 flow [2022-12-11 21:05:02,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 72.38461538461539) internal successors, (941), 13 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:05:02,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:05:02,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:05:02,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 21:05:02,169 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:05:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:05:02,169 INFO L85 PathProgramCache]: Analyzing trace with hash 21974716, now seen corresponding path program 3 times [2022-12-11 21:05:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:05:02,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774042510] [2022-12-11 21:05:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:05:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:05:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:05:02,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:05:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:05:02,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:05:02,272 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:05:02,273 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 21:05:02,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 21:05:02,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 21:05:02,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 21:05:02,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 21:05:02,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 21:05:02,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 21:05:02,278 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:05:02,283 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:05:02,283 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:05:02,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:05:02 BasicIcfg [2022-12-11 21:05:02,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:05:02,369 INFO L158 Benchmark]: Toolchain (without parser) took 25036.09ms. Allocated memory was 170.9MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 146.3MB in the beginning and 486.8MB in the end (delta: -340.5MB). Peak memory consumption was 582.8MB. Max. memory is 8.0GB. [2022-12-11 21:05:02,370 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:05:02,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.20ms. Allocated memory is still 170.9MB. Free memory was 145.8MB in the beginning and 119.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 21:05:02,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.69ms. Allocated memory is still 170.9MB. Free memory was 119.6MB in the beginning and 117.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 21:05:02,370 INFO L158 Benchmark]: Boogie Preprocessor took 33.29ms. Allocated memory is still 170.9MB. Free memory was 117.0MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:05:02,370 INFO L158 Benchmark]: RCFGBuilder took 564.03ms. Allocated memory is still 170.9MB. Free memory was 114.9MB in the beginning and 128.5MB in the end (delta: -13.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-11 21:05:02,370 INFO L158 Benchmark]: TraceAbstraction took 23915.69ms. Allocated memory was 170.9MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 127.5MB in the beginning and 486.8MB in the end (delta: -359.3MB). Peak memory consumption was 563.9MB. Max. memory is 8.0GB. [2022-12-11 21:05:02,371 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.10ms. Allocated memory is still 170.9MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 469.20ms. Allocated memory is still 170.9MB. Free memory was 145.8MB in the beginning and 119.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.69ms. Allocated memory is still 170.9MB. Free memory was 119.6MB in the beginning and 117.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.29ms. Allocated memory is still 170.9MB. Free memory was 117.0MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.03ms. Allocated memory is still 170.9MB. Free memory was 114.9MB in the beginning and 128.5MB in the end (delta: -13.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 23915.69ms. Allocated memory was 170.9MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 127.5MB in the beginning and 486.8MB in the end (delta: -359.3MB). Peak memory consumption was 563.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 817]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1384 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1384 mSDsluCounter, 1728 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1389 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2828 IncrementalHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 339 mSDtfsCounter, 2828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9790occurred in iteration=14, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 49221 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1279 ConstructedInterpolants, 0 QuantifiedInterpolants, 8520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 21:05:02,393 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...