/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:35:59,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:35:59,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:35:59,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:35:59,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:35:59,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:35:59,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:35:59,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:35:59,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:35:59,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:35:59,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:35:59,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:35:59,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:35:59,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:35:59,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:35:59,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:35:59,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:35:59,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:35:59,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:35:59,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:35:59,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:35:59,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:35:59,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:35:59,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:35:59,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:35:59,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:35:59,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:35:59,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:35:59,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:35:59,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:35:59,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:35:59,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:35:59,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:35:59,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:35:59,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:35:59,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:35:59,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:35:59,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:35:59,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:35:59,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:35:59,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:35:59,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:35:59,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:35:59,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:35:59,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:35:59,887 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:35:59,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:35:59,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:35:59,887 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:35:59,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:35:59,888 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:35:59,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:35:59,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:35:59,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:35:59,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:35:59,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:35:59,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:35:59,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:35:59,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:35:59,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:35:59,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:35:59,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:35:59,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:35:59,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:35:59,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:35:59,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:35:59,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:35:59,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:35:59,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:35:59,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:35:59,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:35:59,890 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:35:59,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:36:00,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:36:00,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:36:00,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:36:00,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:36:00,193 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:36:00,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2022-12-12 18:36:01,110 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:36:01,351 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:36:01,352 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2022-12-12 18:36:01,377 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572b8d86b/777849bd54ca45948b01da144cec48de/FLAGbcc8165bf [2022-12-12 18:36:01,391 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572b8d86b/777849bd54ca45948b01da144cec48de [2022-12-12 18:36:01,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:36:01,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:36:01,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:36:01,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:36:01,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:36:01,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b8fe66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01, skipping insertion in model container [2022-12-12 18:36:01,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:36:01,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:36:01,570 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/mix032.opt.i[944,957] [2022-12-12 18:36:01,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:36:01,755 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:36:01,763 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/mix032.opt.i[944,957] [2022-12-12 18:36:01,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:36:01,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:36:01,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:36:01,824 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:36:01,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01 WrapperNode [2022-12-12 18:36:01,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:36:01,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:36:01,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:36:01,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:36:01,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,878 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-12-12 18:36:01,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:36:01,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:36:01,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:36:01,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:36:01,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:36:01,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:36:01,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:36:01,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:36:01,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (1/1) ... [2022-12-12 18:36:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:36:01,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:36:01,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:36:01,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:36:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:36:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:36:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:36:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:36:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:36:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:36:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:36:01,991 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:36:02,225 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:36:02,241 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:36:02,513 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:36:02,619 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:36:02,620 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:36:02,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:36:02 BoogieIcfgContainer [2022-12-12 18:36:02,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:36:02,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:36:02,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:36:02,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:36:02,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:36:01" (1/3) ... [2022-12-12 18:36:02,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746a76ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:36:02, skipping insertion in model container [2022-12-12 18:36:02,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:36:01" (2/3) ... [2022-12-12 18:36:02,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746a76ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:36:02, skipping insertion in model container [2022-12-12 18:36:02,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:36:02" (3/3) ... [2022-12-12 18:36:02,631 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2022-12-12 18:36:02,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:36:02,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:36:02,645 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:36:02,689 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:36:02,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-12 18:36:02,772 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-12 18:36:02,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:02,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:36:02,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-12 18:36:02,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-12 18:36:02,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:36:02,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-12 18:36:02,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-12 18:36:02,839 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-12 18:36:02,839 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:02,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 18:36:02,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-12 18:36:02,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 2048 [2022-12-12 18:36:06,782 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-12 18:36:06,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:36:06,822 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;@5cb6a82a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:36:06,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:36:06,826 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-12 18:36:06,826 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:36:06,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:06,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:06,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash -192693887, now seen corresponding path program 1 times [2022-12-12 18:36:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:06,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860681726] [2022-12-12 18:36:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:07,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:07,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860681726] [2022-12-12 18:36:07,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860681726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:07,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:07,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:36:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011844684] [2022-12-12 18:36:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:07,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:36:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:07,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:36:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:36:07,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 59 [2022-12-12 18:36:07,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:07,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:07,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 59 [2022-12-12 18:36:07,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:08,452 INFO L130 PetriNetUnfolder]: 8291/13627 cut-off events. [2022-12-12 18:36:08,452 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-12 18:36:08,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25494 conditions, 13627 events. 8291/13627 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 109449 event pairs, 971 based on Foata normal form. 0/7520 useless extension candidates. Maximal degree in co-relation 25483. Up to 10201 conditions per place. [2022-12-12 18:36:08,483 INFO L137 encePairwiseOnDemand]: 52/59 looper letters, 30 selfloop transitions, 3 changer transitions 40/86 dead transitions. [2022-12-12 18:36:08,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 327 flow [2022-12-12 18:36:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:36:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:36:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-12-12 18:36:08,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2022-12-12 18:36:08,494 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2022-12-12 18:36:08,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 86 transitions, 327 flow [2022-12-12 18:36:08,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 46 transitions, 167 flow [2022-12-12 18:36:08,511 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 167 flow [2022-12-12 18:36:08,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:08,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:08,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:08,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:36:08,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1830911371, now seen corresponding path program 1 times [2022-12-12 18:36:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:08,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299773649] [2022-12-12 18:36:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:08,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:08,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299773649] [2022-12-12 18:36:08,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299773649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:08,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:08,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:36:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470464066] [2022-12-12 18:36:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:08,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:36:08,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:08,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:36:08,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:36:08,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 18:36:08,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:08,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:08,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 18:36:08,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:09,398 INFO L130 PetriNetUnfolder]: 5093/7681 cut-off events. [2022-12-12 18:36:09,398 INFO L131 PetriNetUnfolder]: For 1283/1283 co-relation queries the response was YES. [2022-12-12 18:36:09,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20376 conditions, 7681 events. 5093/7681 cut-off events. For 1283/1283 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 42647 event pairs, 1140 based on Foata normal form. 280/6313 useless extension candidates. Maximal degree in co-relation 20362. Up to 5476 conditions per place. [2022-12-12 18:36:09,433 INFO L137 encePairwiseOnDemand]: 53/59 looper letters, 53 selfloop transitions, 4 changer transitions 40/104 dead transitions. [2022-12-12 18:36:09,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 104 transitions, 573 flow [2022-12-12 18:36:09,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-12 18:36:09,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36271186440677966 [2022-12-12 18:36:09,438 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2022-12-12 18:36:09,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 104 transitions, 573 flow [2022-12-12 18:36:09,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 64 transitions, 355 flow [2022-12-12 18:36:09,464 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 64 transitions, 355 flow [2022-12-12 18:36:09,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:09,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:09,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:09,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:36:09,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -263299143, now seen corresponding path program 1 times [2022-12-12 18:36:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:09,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832528663] [2022-12-12 18:36:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:09,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832528663] [2022-12-12 18:36:09,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832528663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:09,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:09,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:36:09,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056496721] [2022-12-12 18:36:09,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:09,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:09,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:09,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:09,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 18:36:09,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 64 transitions, 355 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:09,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:09,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 18:36:09,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:09,944 INFO L130 PetriNetUnfolder]: 3258/4970 cut-off events. [2022-12-12 18:36:09,945 INFO L131 PetriNetUnfolder]: For 834/834 co-relation queries the response was YES. [2022-12-12 18:36:09,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18252 conditions, 4970 events. 3258/4970 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25830 event pairs, 364 based on Foata normal form. 232/4130 useless extension candidates. Maximal degree in co-relation 18235. Up to 4593 conditions per place. [2022-12-12 18:36:09,964 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 63 selfloop transitions, 3 changer transitions 38/111 dead transitions. [2022-12-12 18:36:09,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 111 transitions, 827 flow [2022-12-12 18:36:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-12 18:36:09,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3525423728813559 [2022-12-12 18:36:09,966 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -16 predicate places. [2022-12-12 18:36:09,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 111 transitions, 827 flow [2022-12-12 18:36:09,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 73 transitions, 537 flow [2022-12-12 18:36:09,980 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 73 transitions, 537 flow [2022-12-12 18:36:09,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:09,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:09,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:36:09,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1424819002, now seen corresponding path program 1 times [2022-12-12 18:36:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:09,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165379634] [2022-12-12 18:36:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:10,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165379634] [2022-12-12 18:36:10,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165379634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:10,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:10,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:36:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616001556] [2022-12-12 18:36:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:10,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:10,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 18:36:10,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 73 transitions, 537 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:10,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:10,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 18:36:10,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:10,386 INFO L130 PetriNetUnfolder]: 2528/3915 cut-off events. [2022-12-12 18:36:10,386 INFO L131 PetriNetUnfolder]: For 678/678 co-relation queries the response was YES. [2022-12-12 18:36:10,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18043 conditions, 3915 events. 2528/3915 cut-off events. For 678/678 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19777 event pairs, 192 based on Foata normal form. 175/3342 useless extension candidates. Maximal degree in co-relation 18023. Up to 3602 conditions per place. [2022-12-12 18:36:10,407 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 79 selfloop transitions, 4 changer transitions 28/118 dead transitions. [2022-12-12 18:36:10,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 118 transitions, 1104 flow [2022-12-12 18:36:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-12 18:36:10,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3389830508474576 [2022-12-12 18:36:10,411 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2022-12-12 18:36:10,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 118 transitions, 1104 flow [2022-12-12 18:36:10,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 90 transitions, 836 flow [2022-12-12 18:36:10,426 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 90 transitions, 836 flow [2022-12-12 18:36:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:10,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:10,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:10,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:36:10,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 876734099, now seen corresponding path program 1 times [2022-12-12 18:36:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:10,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248076488] [2022-12-12 18:36:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248076488] [2022-12-12 18:36:10,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248076488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:10,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:10,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:36:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605415193] [2022-12-12 18:36:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:10,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:36:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:36:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:36:10,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 18:36:10,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 90 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:10,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:10,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 18:36:10,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:10,909 INFO L130 PetriNetUnfolder]: 3013/4659 cut-off events. [2022-12-12 18:36:10,909 INFO L131 PetriNetUnfolder]: For 6560/6697 co-relation queries the response was YES. [2022-12-12 18:36:10,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24272 conditions, 4659 events. 3013/4659 cut-off events. For 6560/6697 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 25300 event pairs, 349 based on Foata normal form. 370/4284 useless extension candidates. Maximal degree in co-relation 24249. Up to 4064 conditions per place. [2022-12-12 18:36:10,936 INFO L137 encePairwiseOnDemand]: 47/59 looper letters, 84 selfloop transitions, 26 changer transitions 87/214 dead transitions. [2022-12-12 18:36:10,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 214 transitions, 2407 flow [2022-12-12 18:36:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-12 18:36:10,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4135593220338983 [2022-12-12 18:36:10,938 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -14 predicate places. [2022-12-12 18:36:10,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 214 transitions, 2407 flow [2022-12-12 18:36:10,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 127 transitions, 1411 flow [2022-12-12 18:36:10,960 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 127 transitions, 1411 flow [2022-12-12 18:36:10,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:10,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:10,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:10,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:36:10,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash -150520944, now seen corresponding path program 1 times [2022-12-12 18:36:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:10,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221372003] [2022-12-12 18:36:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:11,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221372003] [2022-12-12 18:36:11,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221372003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:11,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:11,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 18:36:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881698031] [2022-12-12 18:36:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:11,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 18:36:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 18:36:11,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 18:36:11,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 59 [2022-12-12 18:36:11,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 127 transitions, 1411 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:11,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:11,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 59 [2022-12-12 18:36:11,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:11,754 INFO L130 PetriNetUnfolder]: 2603/3947 cut-off events. [2022-12-12 18:36:11,754 INFO L131 PetriNetUnfolder]: For 4499/4499 co-relation queries the response was YES. [2022-12-12 18:36:11,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24043 conditions, 3947 events. 2603/3947 cut-off events. For 4499/4499 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 19350 event pairs, 377 based on Foata normal form. 12/3433 useless extension candidates. Maximal degree in co-relation 24017. Up to 3833 conditions per place. [2022-12-12 18:36:11,778 INFO L137 encePairwiseOnDemand]: 47/59 looper letters, 137 selfloop transitions, 31 changer transitions 0/172 dead transitions. [2022-12-12 18:36:11,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 172 transitions, 2212 flow [2022-12-12 18:36:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 18:36:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 18:36:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2022-12-12 18:36:11,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-12 18:36:11,782 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2022-12-12 18:36:11,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 172 transitions, 2212 flow [2022-12-12 18:36:11,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 172 transitions, 2212 flow [2022-12-12 18:36:11,805 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 172 transitions, 2212 flow [2022-12-12 18:36:11,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:11,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:11,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:11,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:36:11,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1417245470, now seen corresponding path program 2 times [2022-12-12 18:36:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:11,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781560146] [2022-12-12 18:36:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:11,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781560146] [2022-12-12 18:36:11,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781560146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:11,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:11,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:36:11,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773119828] [2022-12-12 18:36:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:11,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:11,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 18:36:11,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 172 transitions, 2212 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:11,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:11,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 18:36:11,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:12,294 INFO L130 PetriNetUnfolder]: 1760/2972 cut-off events. [2022-12-12 18:36:12,294 INFO L131 PetriNetUnfolder]: For 5652/5652 co-relation queries the response was YES. [2022-12-12 18:36:12,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20514 conditions, 2972 events. 1760/2972 cut-off events. For 5652/5652 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 16332 event pairs, 140 based on Foata normal form. 276/2863 useless extension candidates. Maximal degree in co-relation 20485. Up to 2858 conditions per place. [2022-12-12 18:36:12,316 INFO L137 encePairwiseOnDemand]: 47/59 looper letters, 91 selfloop transitions, 55 changer transitions 63/239 dead transitions. [2022-12-12 18:36:12,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 239 transitions, 3491 flow [2022-12-12 18:36:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:36:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:36:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2022-12-12 18:36:12,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4180790960451977 [2022-12-12 18:36:12,318 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2022-12-12 18:36:12,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 239 transitions, 3491 flow [2022-12-12 18:36:12,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 176 transitions, 2555 flow [2022-12-12 18:36:12,332 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 176 transitions, 2555 flow [2022-12-12 18:36:12,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:12,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:12,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:12,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:36:12,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -558225871, now seen corresponding path program 1 times [2022-12-12 18:36:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734682380] [2022-12-12 18:36:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734682380] [2022-12-12 18:36:12,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734682380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:12,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:36:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201313394] [2022-12-12 18:36:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:12,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:36:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:36:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:36:12,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 18:36:12,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 176 transitions, 2555 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:12,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:12,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 18:36:12,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:12,704 INFO L130 PetriNetUnfolder]: 842/1541 cut-off events. [2022-12-12 18:36:12,704 INFO L131 PetriNetUnfolder]: For 3895/3895 co-relation queries the response was YES. [2022-12-12 18:36:12,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11891 conditions, 1541 events. 842/1541 cut-off events. For 3895/3895 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7905 event pairs, 24 based on Foata normal form. 135/1471 useless extension candidates. Maximal degree in co-relation 11859. Up to 1451 conditions per place. [2022-12-12 18:36:12,713 INFO L137 encePairwiseOnDemand]: 47/59 looper letters, 76 selfloop transitions, 64 changer transitions 18/188 dead transitions. [2022-12-12 18:36:12,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 188 transitions, 3039 flow [2022-12-12 18:36:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:36:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:36:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-12 18:36:12,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3486682808716707 [2022-12-12 18:36:12,715 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2022-12-12 18:36:12,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 188 transitions, 3039 flow [2022-12-12 18:36:12,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 170 transitions, 2739 flow [2022-12-12 18:36:12,723 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 170 transitions, 2739 flow [2022-12-12 18:36:12,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:12,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:12,723 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] [2022-12-12 18:36:12,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:36:12,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1570996249, now seen corresponding path program 1 times [2022-12-12 18:36:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:12,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203766357] [2022-12-12 18:36:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:12,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-12 18:36:12,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:12,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203766357] [2022-12-12 18:36:12,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203766357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:12,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:12,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:36:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126578896] [2022-12-12 18:36:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:12,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:12,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 18:36:12,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 170 transitions, 2739 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:12,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:12,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 18:36:12,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:13,117 INFO L130 PetriNetUnfolder]: 962/1779 cut-off events. [2022-12-12 18:36:13,117 INFO L131 PetriNetUnfolder]: For 5104/5104 co-relation queries the response was YES. [2022-12-12 18:36:13,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15084 conditions, 1779 events. 962/1779 cut-off events. For 5104/5104 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9671 event pairs, 29 based on Foata normal form. 27/1533 useless extension candidates. Maximal degree in co-relation 15049. Up to 1692 conditions per place. [2022-12-12 18:36:13,127 INFO L137 encePairwiseOnDemand]: 50/59 looper letters, 187 selfloop transitions, 37 changer transitions 31/270 dead transitions. [2022-12-12 18:36:13,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 270 transitions, 4947 flow [2022-12-12 18:36:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:36:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:36:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-12 18:36:13,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3107344632768362 [2022-12-12 18:36:13,129 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2022-12-12 18:36:13,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 270 transitions, 4947 flow [2022-12-12 18:36:13,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 239 transitions, 4372 flow [2022-12-12 18:36:13,138 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 239 transitions, 4372 flow [2022-12-12 18:36:13,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:13,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:13,139 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] [2022-12-12 18:36:13,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:36:13,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2136858114, now seen corresponding path program 1 times [2022-12-12 18:36:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:13,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123586952] [2022-12-12 18:36:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:13,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123586952] [2022-12-12 18:36:13,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123586952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:13,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:13,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:36:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270545492] [2022-12-12 18:36:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:13,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:13,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 18:36:13,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 239 transitions, 4372 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:13,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:13,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 18:36:13,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:13,601 INFO L130 PetriNetUnfolder]: 1034/1974 cut-off events. [2022-12-12 18:36:13,602 INFO L131 PetriNetUnfolder]: For 7084/7084 co-relation queries the response was YES. [2022-12-12 18:36:13,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17838 conditions, 1974 events. 1034/1974 cut-off events. For 7084/7084 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11518 event pairs, 48 based on Foata normal form. 27/1692 useless extension candidates. Maximal degree in co-relation 17800. Up to 1887 conditions per place. [2022-12-12 18:36:13,611 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 93 selfloop transitions, 5 changer transitions 157/279 dead transitions. [2022-12-12 18:36:13,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 279 transitions, 5640 flow [2022-12-12 18:36:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-12 18:36:13,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33220338983050846 [2022-12-12 18:36:13,613 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2022-12-12 18:36:13,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 279 transitions, 5640 flow [2022-12-12 18:36:13,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 122 transitions, 2373 flow [2022-12-12 18:36:13,620 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 122 transitions, 2373 flow [2022-12-12 18:36:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:13,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:13,620 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] [2022-12-12 18:36:13,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:36:13,620 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:13,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 65470463, now seen corresponding path program 1 times [2022-12-12 18:36:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:13,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266744811] [2022-12-12 18:36:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:13,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266744811] [2022-12-12 18:36:13,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266744811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:13,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:13,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:36:13,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954760764] [2022-12-12 18:36:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:13,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:36:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:13,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:36:13,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:36:13,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-12 18:36:13,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 122 transitions, 2373 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:13,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:13,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-12 18:36:13,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:13,916 INFO L130 PetriNetUnfolder]: 560/1187 cut-off events. [2022-12-12 18:36:13,917 INFO L131 PetriNetUnfolder]: For 4914/4914 co-relation queries the response was YES. [2022-12-12 18:36:13,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11843 conditions, 1187 events. 560/1187 cut-off events. For 4914/4914 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6901 event pairs, 14 based on Foata normal form. 27/1004 useless extension candidates. Maximal degree in co-relation 11802. Up to 1153 conditions per place. [2022-12-12 18:36:13,923 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 61 selfloop transitions, 3 changer transitions 97/175 dead transitions. [2022-12-12 18:36:13,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 175 transitions, 3819 flow [2022-12-12 18:36:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:36:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:36:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-12 18:36:13,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31864406779661014 [2022-12-12 18:36:13,924 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2022-12-12 18:36:13,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 175 transitions, 3819 flow [2022-12-12 18:36:13,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 78 transitions, 1659 flow [2022-12-12 18:36:13,929 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 1659 flow [2022-12-12 18:36:13,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:13,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:13,929 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] [2022-12-12 18:36:13,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:36:13,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:13,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2012577615, now seen corresponding path program 2 times [2022-12-12 18:36:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:13,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193732212] [2022-12-12 18:36:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:36:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:36:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:36:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193732212] [2022-12-12 18:36:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193732212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:36:14,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:36:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:36:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947284354] [2022-12-12 18:36:14,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:36:14,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:36:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:36:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:36:14,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:36:14,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2022-12-12 18:36:14,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 1659 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:14,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:36:14,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2022-12-12 18:36:14,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:36:14,410 INFO L130 PetriNetUnfolder]: 336/830 cut-off events. [2022-12-12 18:36:14,410 INFO L131 PetriNetUnfolder]: For 2913/2913 co-relation queries the response was YES. [2022-12-12 18:36:14,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9039 conditions, 830 events. 336/830 cut-off events. For 2913/2913 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5192 event pairs, 2 based on Foata normal form. 27/693 useless extension candidates. Maximal degree in co-relation 8995. Up to 823 conditions per place. [2022-12-12 18:36:14,414 INFO L137 encePairwiseOnDemand]: 51/59 looper letters, 42 selfloop transitions, 5 changer transitions 65/122 dead transitions. [2022-12-12 18:36:14,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 2907 flow [2022-12-12 18:36:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:36:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:36:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-12 18:36:14,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21822033898305085 [2022-12-12 18:36:14,416 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2022-12-12 18:36:14,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 122 transitions, 2907 flow [2022-12-12 18:36:14,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 57 transitions, 1271 flow [2022-12-12 18:36:14,419 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 1271 flow [2022-12-12 18:36:14,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:36:14,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:36:14,419 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] [2022-12-12 18:36:14,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:36:14,420 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:36:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:36:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1503743311, now seen corresponding path program 3 times [2022-12-12 18:36:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:36:14,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225965147] [2022-12-12 18:36:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:36:14,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:36:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:36:14,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:36:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:36:14,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:36:14,498 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:36:14,498 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:36:14,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:36:14,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:36:14,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:36:14,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:36:14,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:36:14,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:36:14,501 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:36:14,508 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:36:14,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:36:14,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:36:14 BasicIcfg [2022-12-12 18:36:14,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:36:14,583 INFO L158 Benchmark]: Toolchain (without parser) took 13189.28ms. Allocated memory was 185.6MB in the beginning and 607.1MB in the end (delta: 421.5MB). Free memory was 160.6MB in the beginning and 448.1MB in the end (delta: -287.5MB). Peak memory consumption was 135.6MB. Max. memory is 8.0GB. [2022-12-12 18:36:14,583 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory was 162.3MB in the beginning and 162.3MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:36:14,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.67ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 133.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 18:36:14,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.75ms. Allocated memory is still 185.6MB. Free memory was 133.9MB in the beginning and 131.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:36:14,585 INFO L158 Benchmark]: Boogie Preprocessor took 29.29ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:36:14,585 INFO L158 Benchmark]: RCFGBuilder took 714.74ms. Allocated memory is still 185.6MB. Free memory was 129.1MB in the beginning and 99.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 18:36:14,585 INFO L158 Benchmark]: TraceAbstraction took 11956.48ms. Allocated memory was 185.6MB in the beginning and 607.1MB in the end (delta: 421.5MB). Free memory was 98.2MB in the beginning and 448.1MB in the end (delta: -349.8MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. [2022-12-12 18:36:14,586 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory was 162.3MB in the beginning and 162.3MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.67ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 133.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.75ms. Allocated memory is still 185.6MB. Free memory was 133.9MB in the beginning and 131.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.29ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 714.74ms. Allocated memory is still 185.6MB. Free memory was 129.1MB in the beginning and 99.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 11956.48ms. Allocated memory was 185.6MB in the beginning and 607.1MB in the end (delta: 421.5MB). Free memory was 98.2MB in the beginning and 448.1MB in the end (delta: -349.8MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 120 PlacesBefore, 68 PlacesAfterwards, 112 TransitionsBefore, 59 TransitionsAfterwards, 2048 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3715, independent: 3602, independent conditional: 3602, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3715, independent: 3602, independent conditional: 0, independent unconditional: 3602, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3715, independent: 3602, independent conditional: 0, independent unconditional: 3602, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3715, independent: 3602, independent conditional: 0, independent unconditional: 3602, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1789, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1789, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3715, independent: 1851, independent conditional: 0, independent unconditional: 1851, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 1789, unknown conditional: 0, unknown unconditional: 1789] , Statistics on independence cache: Total cache size (in pairs): 3704, Positive cache size: 3666, Positive conditional cache size: 0, Positive unconditional cache size: 3666, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t852; [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t852, ((void *)0), P0, ((void *)0))=-3, t852={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] [L847] 0 pthread_t t853; [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t853, ((void *)0), P1, ((void *)0))=-2, t852={5:0}, t853={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=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] [L849] 0 pthread_t t854; [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t854, ((void *)0), P2, ((void *)0))=-1, t852={5:0}, t853={6:0}, t854={3: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] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 [L814] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 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) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 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 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 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, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 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) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 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 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 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, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, 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=1, 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=1, 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: 848]: 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: 846]: 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: 850]: 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, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1588 IncrementalHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 51 mSDtfsCounter, 1588 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4372occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 10806 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:36:14,605 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...