/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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:39:39,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:39:39,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:39:39,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:39:39,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:39:39,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:39:39,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:39:39,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:39:39,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:39:39,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:39:39,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:39:39,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:39:39,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:39:39,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:39:39,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:39:39,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:39:39,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:39:39,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:39:39,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:39:39,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:39:39,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:39:39,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:39:39,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:39:39,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:39:39,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:39:39,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:39:39,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:39:39,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:39:39,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:39:39,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:39:39,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:39:39,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:39:39,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:39:39,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:39:39,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:39:39,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:39:39,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:39:39,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:39:39,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:39:39,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:39:39,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:39:39,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:39:39,873 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:39:39,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:39:39,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:39:39,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:39:39,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:39:39,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:39:39,876 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:39:39,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:39:39,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:39:39,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:39:39,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:39:39,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:39:39,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:39:39,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:39:39,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:39:39,877 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:39:39,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:39:39,878 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:39:39,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:39:39,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:39:39,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:39:39,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:39:39,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:39:39,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:39:39,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:39:39,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:39:39,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:39:39,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:39:39,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:39:39,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:39:39,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:39:40,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:39:40,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:39:40,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:39:40,150 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:39:40,151 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:39:40,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 18:39:41,170 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:39:41,422 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:39:41,423 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 18:39:41,434 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765e7fe74/7a3923ada3c549968a212867a7feacd0/FLAG38d4522aa [2022-12-12 18:39:41,447 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765e7fe74/7a3923ada3c549968a212867a7feacd0 [2022-12-12 18:39:41,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:39:41,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:39:41,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:39:41,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:39:41,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:39:41,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:41,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0f0274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41, skipping insertion in model container [2022-12-12 18:39:41,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:41,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:39:41,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:39:41,652 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 18:39:41,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:39:41,861 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:39:41,871 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-12 18:39:41,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:39:41,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:39:41,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:39:41,963 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:39:41,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41 WrapperNode [2022-12-12 18:39:41,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:39:41,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:39:41,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:39:41,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:39:41,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:41,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,025 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-12 18:39:42,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:39:42,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:39:42,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:39:42,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:39:42,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,052 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:39:42,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:39:42,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:39:42,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:39:42,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (1/1) ... [2022-12-12 18:39:42,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:39:42,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:39:42,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:39:42,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:39:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:39:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:39:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:39:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:39:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:39:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:39:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:39:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:39:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:39:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:39:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:39:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:39:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:39:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:39:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:39:42,164 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:39:42,295 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:39:42,296 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:39:42,465 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:39:42,628 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:39:42,629 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:39:42,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:39:42 BoogieIcfgContainer [2022-12-12 18:39:42,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:39:42,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:39:42,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:39:42,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:39:42,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:39:41" (1/3) ... [2022-12-12 18:39:42,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2baac738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:39:42, skipping insertion in model container [2022-12-12 18:39:42,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:39:41" (2/3) ... [2022-12-12 18:39:42,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2baac738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:39:42, skipping insertion in model container [2022-12-12 18:39:42,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:39:42" (3/3) ... [2022-12-12 18:39:42,650 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-12 18:39:42,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:39:42,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:39:42,664 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:39:42,742 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:39:42,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 18:39:42,856 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 18:39:42,856 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:42,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 18:39:42,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-12 18:39:42,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:42,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:39:42,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:42,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:42,965 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-12 18:39:42,965 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:42,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 18:39:42,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-12 18:39:42,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-12 18:39:49,694 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-12 18:39:49,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:39:49,710 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;@17ef4faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:39:49,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:39:49,713 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-12 18:39:49,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:39:49,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:49,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:49,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1323519518, now seen corresponding path program 1 times [2022-12-12 18:39:49,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:49,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290777252] [2022-12-12 18:39:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:49,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:50,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290777252] [2022-12-12 18:39:50,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290777252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:50,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:50,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:39:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208061037] [2022-12-12 18:39:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:50,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-12 18:39:50,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:50,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:50,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-12 18:39:50,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:51,092 INFO L130 PetriNetUnfolder]: 6079/9809 cut-off events. [2022-12-12 18:39:51,092 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 18:39:51,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18592 conditions, 9809 events. 6079/9809 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 73377 event pairs, 855 based on Foata normal form. 0/5894 useless extension candidates. Maximal degree in co-relation 18581. Up to 7305 conditions per place. [2022-12-12 18:39:51,123 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-12 18:39:51,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-12 18:39:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-12 18:39:51,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-12 18:39:51,136 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2022-12-12 18:39:51,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 84 transitions, 325 flow [2022-12-12 18:39:51,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 40 transitions, 149 flow [2022-12-12 18:39:51,150 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 149 flow [2022-12-12 18:39:51,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:51,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:51,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:51,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:39:51,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash 592008445, now seen corresponding path program 1 times [2022-12-12 18:39:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:51,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786608695] [2022-12-12 18:39:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786608695] [2022-12-12 18:39:51,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786608695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:51,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:51,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:39:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554670857] [2022-12-12 18:39:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:51,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:51,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:51,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:51,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:51,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:51,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:51,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:51,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:51,624 INFO L130 PetriNetUnfolder]: 1136/1951 cut-off events. [2022-12-12 18:39:51,624 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-12 18:39:51,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5286 conditions, 1951 events. 1136/1951 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10772 event pairs, 74 based on Foata normal form. 10/1641 useless extension candidates. Maximal degree in co-relation 5272. Up to 1615 conditions per place. [2022-12-12 18:39:51,639 INFO L137 encePairwiseOnDemand]: 52/56 looper letters, 44 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2022-12-12 18:39:51,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 317 flow [2022-12-12 18:39:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-12 18:39:51,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2022-12-12 18:39:51,643 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2022-12-12 18:39:51,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 57 transitions, 317 flow [2022-12-12 18:39:51,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 57 transitions, 317 flow [2022-12-12 18:39:51,651 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 57 transitions, 317 flow [2022-12-12 18:39:51,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:51,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:51,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:51,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:39:51,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:51,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1172391830, now seen corresponding path program 1 times [2022-12-12 18:39:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:51,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936101526] [2022-12-12 18:39:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:52,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936101526] [2022-12-12 18:39:52,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936101526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:52,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:52,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120099585] [2022-12-12 18:39:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:52,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:52,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:52,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:52,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 57 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:39:52,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:52,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:52,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:52,287 INFO L130 PetriNetUnfolder]: 1363/2258 cut-off events. [2022-12-12 18:39:52,288 INFO L131 PetriNetUnfolder]: For 628/628 co-relation queries the response was YES. [2022-12-12 18:39:52,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7927 conditions, 2258 events. 1363/2258 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11896 event pairs, 91 based on Foata normal form. 8/1906 useless extension candidates. Maximal degree in co-relation 7910. Up to 1839 conditions per place. [2022-12-12 18:39:52,300 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 56 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2022-12-12 18:39:52,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 550 flow [2022-12-12 18:39:52,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-12 18:39:52,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2022-12-12 18:39:52,302 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-12-12 18:39:52,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 75 transitions, 550 flow [2022-12-12 18:39:52,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 75 transitions, 550 flow [2022-12-12 18:39:52,312 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 75 transitions, 550 flow [2022-12-12 18:39:52,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:39:52,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:52,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:52,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:39:52,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1989725910, now seen corresponding path program 1 times [2022-12-12 18:39:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:52,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635253196] [2022-12-12 18:39:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:52,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:52,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635253196] [2022-12-12 18:39:52,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635253196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:52,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:52,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233729837] [2022-12-12 18:39:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:52,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:52,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:52,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 75 transitions, 550 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:52,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:52,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:52,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:52,868 INFO L130 PetriNetUnfolder]: 1349/2204 cut-off events. [2022-12-12 18:39:52,868 INFO L131 PetriNetUnfolder]: For 971/971 co-relation queries the response was YES. [2022-12-12 18:39:52,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9693 conditions, 2204 events. 1349/2204 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11337 event pairs, 131 based on Foata normal form. 5/1850 useless extension candidates. Maximal degree in co-relation 9673. Up to 1820 conditions per place. [2022-12-12 18:39:52,880 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 63 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2022-12-12 18:39:52,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 763 flow [2022-12-12 18:39:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-12 18:39:52,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-12 18:39:52,882 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -15 predicate places. [2022-12-12 18:39:52,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 83 transitions, 763 flow [2022-12-12 18:39:52,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 83 transitions, 763 flow [2022-12-12 18:39:52,892 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 83 transitions, 763 flow [2022-12-12 18:39:52,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:52,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:52,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:52,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:39:52,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1989779726, now seen corresponding path program 1 times [2022-12-12 18:39:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:52,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109769947] [2022-12-12 18:39:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:53,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109769947] [2022-12-12 18:39:53,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109769947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:53,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:53,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438776756] [2022-12-12 18:39:53,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:53,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:53,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:53,221 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:53,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 83 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:53,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:53,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:53,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:53,431 INFO L130 PetriNetUnfolder]: 1367/2244 cut-off events. [2022-12-12 18:39:53,432 INFO L131 PetriNetUnfolder]: For 1643/1643 co-relation queries the response was YES. [2022-12-12 18:39:53,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11730 conditions, 2244 events. 1367/2244 cut-off events. For 1643/1643 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11615 event pairs, 111 based on Foata normal form. 8/1891 useless extension candidates. Maximal degree in co-relation 11707. Up to 1840 conditions per place. [2022-12-12 18:39:53,446 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 78 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2022-12-12 18:39:53,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 105 transitions, 1165 flow [2022-12-12 18:39:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-12 18:39:53,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2022-12-12 18:39:53,448 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2022-12-12 18:39:53,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 105 transitions, 1165 flow [2022-12-12 18:39:53,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 105 transitions, 1165 flow [2022-12-12 18:39:53,459 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 105 transitions, 1165 flow [2022-12-12 18:39:53,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:53,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:53,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:53,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:39:53,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1989625346, now seen corresponding path program 2 times [2022-12-12 18:39:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496838501] [2022-12-12 18:39:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:53,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496838501] [2022-12-12 18:39:53,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496838501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:53,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:53,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:53,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916685736] [2022-12-12 18:39:53,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:53,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:53,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:53,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:53,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:53,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:53,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 105 transitions, 1165 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:53,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:53,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:53,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:53,993 INFO L130 PetriNetUnfolder]: 1390/2299 cut-off events. [2022-12-12 18:39:53,994 INFO L131 PetriNetUnfolder]: For 2380/2380 co-relation queries the response was YES. [2022-12-12 18:39:53,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13916 conditions, 2299 events. 1390/2299 cut-off events. For 2380/2380 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12248 event pairs, 91 based on Foata normal form. 43/1968 useless extension candidates. Maximal degree in co-relation 13890. Up to 1885 conditions per place. [2022-12-12 18:39:54,010 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 90 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2022-12-12 18:39:54,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 117 transitions, 1519 flow [2022-12-12 18:39:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-12 18:39:54,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3535714285714286 [2022-12-12 18:39:54,012 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -7 predicate places. [2022-12-12 18:39:54,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 117 transitions, 1519 flow [2022-12-12 18:39:54,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 117 transitions, 1519 flow [2022-12-12 18:39:54,025 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 117 transitions, 1519 flow [2022-12-12 18:39:54,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:54,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:54,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:54,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:39:54,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 866111213, now seen corresponding path program 1 times [2022-12-12 18:39:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:54,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789848762] [2022-12-12 18:39:54,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:54,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789848762] [2022-12-12 18:39:54,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789848762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:54,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:54,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:39:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137637987] [2022-12-12 18:39:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:54,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:39:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:39:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:39:54,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:54,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 117 transitions, 1519 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:54,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:54,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:54,773 INFO L130 PetriNetUnfolder]: 1543/2537 cut-off events. [2022-12-12 18:39:54,774 INFO L131 PetriNetUnfolder]: For 3341/3341 co-relation queries the response was YES. [2022-12-12 18:39:54,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17609 conditions, 2537 events. 1543/2537 cut-off events. For 3341/3341 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13831 event pairs, 81 based on Foata normal form. 15/2143 useless extension candidates. Maximal degree in co-relation 17580. Up to 2113 conditions per place. [2022-12-12 18:39:54,792 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 111 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2022-12-12 18:39:54,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 134 transitions, 2005 flow [2022-12-12 18:39:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-12 18:39:54,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-12 18:39:54,794 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2022-12-12 18:39:54,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 134 transitions, 2005 flow [2022-12-12 18:39:54,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 134 transitions, 2005 flow [2022-12-12 18:39:54,808 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 134 transitions, 2005 flow [2022-12-12 18:39:54,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:54,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:54,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:54,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:39:54,809 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 871000223, now seen corresponding path program 2 times [2022-12-12 18:39:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:54,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296689737] [2022-12-12 18:39:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296689737] [2022-12-12 18:39:55,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296689737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:55,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:55,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:39:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608376786] [2022-12-12 18:39:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:55,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:39:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:39:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:39:55,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:55,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 134 transitions, 2005 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:55,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:55,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:55,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:55,807 INFO L130 PetriNetUnfolder]: 1514/2493 cut-off events. [2022-12-12 18:39:55,808 INFO L131 PetriNetUnfolder]: For 4413/4413 co-relation queries the response was YES. [2022-12-12 18:39:55,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19426 conditions, 2493 events. 1514/2493 cut-off events. For 4413/4413 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13420 event pairs, 91 based on Foata normal form. 15/2106 useless extension candidates. Maximal degree in co-relation 19394. Up to 2074 conditions per place. [2022-12-12 18:39:55,824 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 115 selfloop transitions, 21 changer transitions 0/146 dead transitions. [2022-12-12 18:39:55,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 146 transitions, 2469 flow [2022-12-12 18:39:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-12 18:39:55,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-12 18:39:55,828 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 1 predicate places. [2022-12-12 18:39:55,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 146 transitions, 2469 flow [2022-12-12 18:39:55,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 146 transitions, 2469 flow [2022-12-12 18:39:55,843 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 146 transitions, 2469 flow [2022-12-12 18:39:55,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:55,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:55,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:55,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:39:55,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 921295119, now seen corresponding path program 1 times [2022-12-12 18:39:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:55,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009891031] [2022-12-12 18:39:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009891031] [2022-12-12 18:39:56,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009891031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:56,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:56,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:56,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30617314] [2022-12-12 18:39:56,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:56,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:56,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 18:39:56,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 146 transitions, 2469 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:56,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:56,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 18:39:56,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:56,379 INFO L130 PetriNetUnfolder]: 2048/3231 cut-off events. [2022-12-12 18:39:56,379 INFO L131 PetriNetUnfolder]: For 15227/15231 co-relation queries the response was YES. [2022-12-12 18:39:56,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26661 conditions, 3231 events. 2048/3231 cut-off events. For 15227/15231 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17206 event pairs, 275 based on Foata normal form. 49/2835 useless extension candidates. Maximal degree in co-relation 26626. Up to 2770 conditions per place. [2022-12-12 18:39:56,406 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 133 selfloop transitions, 36 changer transitions 0/182 dead transitions. [2022-12-12 18:39:56,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 182 transitions, 3419 flow [2022-12-12 18:39:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-12 18:39:56,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 18:39:56,408 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2022-12-12 18:39:56,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 182 transitions, 3419 flow [2022-12-12 18:39:56,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 182 transitions, 3419 flow [2022-12-12 18:39:56,429 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 182 transitions, 3419 flow [2022-12-12 18:39:56,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:56,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:56,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:56,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:39:56,429 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:39:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1994318955, now seen corresponding path program 1 times [2022-12-12 18:39:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:56,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779682200] [2022-12-12 18:39:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:56,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779682200] [2022-12-12 18:39:56,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779682200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:56,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:56,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091715045] [2022-12-12 18:39:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:56,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:56,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 18:39:56,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 182 transitions, 3419 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:56,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:56,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 18:39:56,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:56,779 INFO L130 PetriNetUnfolder]: 1047/1867 cut-off events. [2022-12-12 18:39:56,779 INFO L131 PetriNetUnfolder]: For 11614/11652 co-relation queries the response was YES. [2022-12-12 18:39:56,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17241 conditions, 1867 events. 1047/1867 cut-off events. For 11614/11652 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10400 event pairs, 61 based on Foata normal form. 161/1777 useless extension candidates. Maximal degree in co-relation 17203. Up to 1554 conditions per place. [2022-12-12 18:39:56,795 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 105 selfloop transitions, 61 changer transitions 0/176 dead transitions. [2022-12-12 18:39:56,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 176 transitions, 3604 flow [2022-12-12 18:39:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-12 18:39:56,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2022-12-12 18:39:56,797 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 4 predicate places. [2022-12-12 18:39:56,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 176 transitions, 3604 flow [2022-12-12 18:39:56,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 176 transitions, 3604 flow [2022-12-12 18:39:56,810 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 176 transitions, 3604 flow [2022-12-12 18:39:56,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:56,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:56,810 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:39:56,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:39:56,811 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:39:56,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -625951675, now seen corresponding path program 1 times [2022-12-12 18:39:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:56,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975488361] [2022-12-12 18:39:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:57,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:57,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975488361] [2022-12-12 18:39:57,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975488361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:57,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:57,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972743741] [2022-12-12 18:39:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:57,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 18:39:57,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 176 transitions, 3604 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:57,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:57,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 18:39:57,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:57,727 INFO L130 PetriNetUnfolder]: 2532/4375 cut-off events. [2022-12-12 18:39:57,727 INFO L131 PetriNetUnfolder]: For 37357/37470 co-relation queries the response was YES. [2022-12-12 18:39:57,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43333 conditions, 4375 events. 2532/4375 cut-off events. For 37357/37470 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 28260 event pairs, 93 based on Foata normal form. 159/3880 useless extension candidates. Maximal degree in co-relation 43292. Up to 3693 conditions per place. [2022-12-12 18:39:57,753 INFO L137 encePairwiseOnDemand]: 46/56 looper letters, 188 selfloop transitions, 48 changer transitions 198/446 dead transitions. [2022-12-12 18:39:57,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 446 transitions, 10291 flow [2022-12-12 18:39:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-12 18:39:57,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-12 18:39:57,755 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2022-12-12 18:39:57,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 446 transitions, 10291 flow [2022-12-12 18:39:57,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 248 transitions, 5633 flow [2022-12-12 18:39:57,774 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 248 transitions, 5633 flow [2022-12-12 18:39:57,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:57,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:57,774 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:39:57,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:39:57,774 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:39:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1251201048, now seen corresponding path program 1 times [2022-12-12 18:39:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:57,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793986146] [2022-12-12 18:39:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:57,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793986146] [2022-12-12 18:39:57,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793986146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:57,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:57,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247131376] [2022-12-12 18:39:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:57,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:57,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 18:39:57,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 248 transitions, 5633 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:57,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:57,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 18:39:57,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:58,225 INFO L130 PetriNetUnfolder]: 1735/3174 cut-off events. [2022-12-12 18:39:58,225 INFO L131 PetriNetUnfolder]: For 19906/20007 co-relation queries the response was YES. [2022-12-12 18:39:58,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34730 conditions, 3174 events. 1735/3174 cut-off events. For 19906/20007 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 21131 event pairs, 151 based on Foata normal form. 123/2761 useless extension candidates. Maximal degree in co-relation 34686. Up to 2875 conditions per place. [2022-12-12 18:39:58,245 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 160 selfloop transitions, 10 changer transitions 100/288 dead transitions. [2022-12-12 18:39:58,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 288 transitions, 7129 flow [2022-12-12 18:39:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-12 18:39:58,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-12 18:39:58,247 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2022-12-12 18:39:58,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 288 transitions, 7129 flow [2022-12-12 18:39:58,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 188 transitions, 4549 flow [2022-12-12 18:39:58,331 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 188 transitions, 4549 flow [2022-12-12 18:39:58,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:58,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:58,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:58,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:39:58,332 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:39:58,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash -275299570, now seen corresponding path program 1 times [2022-12-12 18:39:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:58,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224871963] [2022-12-12 18:39:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:39:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:58,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224871963] [2022-12-12 18:39:58,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224871963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:58,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:58,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:58,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767147107] [2022-12-12 18:39:58,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:58,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:58,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:58,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 18:39:58,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 188 transitions, 4549 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:58,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:58,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 18:39:58,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:58,642 INFO L130 PetriNetUnfolder]: 476/1114 cut-off events. [2022-12-12 18:39:58,642 INFO L131 PetriNetUnfolder]: For 11718/11862 co-relation queries the response was YES. [2022-12-12 18:39:58,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12368 conditions, 1114 events. 476/1114 cut-off events. For 11718/11862 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7314 event pairs, 15 based on Foata normal form. 198/1115 useless extension candidates. Maximal degree in co-relation 12321. Up to 928 conditions per place. [2022-12-12 18:39:58,648 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 36 selfloop transitions, 62 changer transitions 77/181 dead transitions. [2022-12-12 18:39:58,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 181 transitions, 4707 flow [2022-12-12 18:39:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-12 18:39:58,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-12 18:39:58,650 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2022-12-12 18:39:58,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 181 transitions, 4707 flow [2022-12-12 18:39:58,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 104 transitions, 2621 flow [2022-12-12 18:39:58,656 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 104 transitions, 2621 flow [2022-12-12 18:39:58,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:39:58,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:58,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:58,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:39:58,656 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:39:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1671438462, now seen corresponding path program 1 times [2022-12-12 18:39:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:58,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477774450] [2022-12-12 18:39:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:58,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:39:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:58,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:39:58,719 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:39:58,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:39:58,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:39:58,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:39:58,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:39:58,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:39:58,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:39:58,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:39:58,722 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:58,726 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:39:58,726 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:39:58,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:39:58 BasicIcfg [2022-12-12 18:39:58,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:39:58,815 INFO L158 Benchmark]: Toolchain (without parser) took 17365.26ms. Allocated memory was 202.4MB in the beginning and 901.8MB in the end (delta: 699.4MB). Free memory was 176.3MB in the beginning and 615.0MB in the end (delta: -438.7MB). Peak memory consumption was 261.5MB. Max. memory is 8.0GB. [2022-12-12 18:39:58,815 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 177.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:39:58,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.24ms. Allocated memory is still 202.4MB. Free memory was 176.3MB in the beginning and 150.4MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 18:39:58,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.07ms. Allocated memory is still 202.4MB. Free memory was 150.4MB in the beginning and 147.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:39:58,817 INFO L158 Benchmark]: Boogie Preprocessor took 42.42ms. Allocated memory is still 202.4MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:39:58,817 INFO L158 Benchmark]: RCFGBuilder took 574.81ms. Allocated memory is still 202.4MB. Free memory was 145.7MB in the beginning and 113.7MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-12 18:39:58,817 INFO L158 Benchmark]: TraceAbstraction took 16168.57ms. Allocated memory was 202.4MB in the beginning and 901.8MB in the end (delta: 699.4MB). Free memory was 112.6MB in the beginning and 615.0MB in the end (delta: -502.4MB). Peak memory consumption was 197.6MB. Max. memory is 8.0GB. [2022-12-12 18:39:58,818 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.09ms. Allocated memory is still 202.4MB. Free memory is still 177.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.24ms. Allocated memory is still 202.4MB. Free memory was 176.3MB in the beginning and 150.4MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.07ms. Allocated memory is still 202.4MB. Free memory was 150.4MB in the beginning and 147.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.42ms. Allocated memory is still 202.4MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 574.81ms. Allocated memory is still 202.4MB. Free memory was 145.7MB in the beginning and 113.7MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16168.57ms. Allocated memory was 202.4MB in the beginning and 901.8MB in the end (delta: 699.4MB). Free memory was 112.6MB in the beginning and 615.0MB in the end (delta: -502.4MB). Peak memory consumption was 197.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 111 PlacesBefore, 65 PlacesAfterwards, 103 TransitionsBefore, 56 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 3061, independent unconditional: 0, dependent: 117, dependent conditional: 117, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1713, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1713, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3178, independent: 1393, independent conditional: 0, independent unconditional: 1393, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 1713, unknown conditional: 0, unknown unconditional: 1713] , Statistics on independence cache: Total cache size (in pairs): 3019, Positive cache size: 2974, Positive conditional cache size: 0, Positive unconditional cache size: 2974, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-3, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-2, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] 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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: 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, 132 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: 16.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 981 IncrementalHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 16 mSDtfsCounter, 981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5633occurred in iteration=11, InterpolantAutomatonStates: 55, 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, 13 MinimizatonAttempts, 9500 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:39:58,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...